NO Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 08:59:40,767 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 08:59:40,769 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 08:59:40,780 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 08:59:40,780 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 08:59:40,781 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 08:59:40,782 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 08:59:40,784 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 08:59:40,785 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 08:59:40,786 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 08:59:40,787 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 08:59:40,787 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 08:59:40,788 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 08:59:40,789 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 08:59:40,790 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 08:59:40,791 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 08:59:40,792 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 08:59:40,793 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 08:59:40,796 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 08:59:40,797 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 08:59:40,798 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 08:59:40,799 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 08:59:40,801 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 08:59:40,801 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 08:59:40,801 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 08:59:40,802 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 08:59:40,802 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 08:59:40,803 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 08:59:40,803 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 08:59:40,804 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 08:59:40,805 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 08:59:40,805 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 08:59:40,806 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 08:59:40,806 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 08:59:40,807 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 08:59:40,807 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 08:59:40,807 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 08:59:40,808 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 08:59:40,809 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 08:59:40,809 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 08:59:40,824 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 08:59:40,824 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 08:59:40,825 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 08:59:40,825 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 08:59:40,825 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 08:59:40,825 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:59:40,826 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 08:59:40,826 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 08:59:40,826 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 08:59:40,826 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 08:59:40,826 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 08:59:40,826 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 08:59:40,827 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 08:59:40,827 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 08:59:40,827 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 08:59:40,827 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 08:59:40,827 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 08:59:40,827 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 08:59:40,828 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 08:59:40,828 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 08:59:40,828 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 08:59:40,828 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 08:59:40,828 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 08:59:40,828 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 08:59:40,828 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 08:59:40,829 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 08:59:40,829 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 08:59:40,829 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 08:59:40,829 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 08:59:40,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 08:59:40,867 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 08:59:40,871 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 08:59:40,872 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 08:59:40,873 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 08:59:40,873 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 08:59:41,038 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/e896400c9c88490db9ec4694e052884e/FLAGfeb2fe1d3 [2020-06-22 08:59:41,419 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 08:59:41,420 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 08:59:41,420 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 08:59:41,427 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/e896400c9c88490db9ec4694e052884e/FLAGfeb2fe1d3 [2020-06-22 08:59:41,833 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/e896400c9c88490db9ec4694e052884e [2020-06-22 08:59:41,844 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 08:59:41,846 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 08:59:41,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 08:59:41,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 08:59:41,851 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 08:59:41,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:59:41" (1/1) ... [2020-06-22 08:59:41,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb15fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:59:41, skipping insertion in model container [2020-06-22 08:59:41,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 08:59:41" (1/1) ... [2020-06-22 08:59:41,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 08:59:41,881 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 08:59:42,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:59:42,123 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 08:59:42,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 08:59:42,158 INFO L195 MainTranslator]: Completed translation [2020-06-22 08:59:42,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:59:42 WrapperNode [2020-06-22 08:59:42,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 08:59:42,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 08:59:42,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 08:59:42,159 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 08:59:42,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:59:42" (1/1) ... [2020-06-22 08:59:42,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:59:42" (1/1) ... [2020-06-22 08:59:42,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 08:59:42,199 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 08:59:42,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 08:59:42,200 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 08:59:42,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:59:42" (1/1) ... [2020-06-22 08:59:42,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:59:42" (1/1) ... [2020-06-22 08:59:42,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:59:42" (1/1) ... [2020-06-22 08:59:42,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:59:42" (1/1) ... [2020-06-22 08:59:42,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:59:42" (1/1) ... [2020-06-22 08:59:42,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:59:42" (1/1) ... [2020-06-22 08:59:42,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:59:42" (1/1) ... [2020-06-22 08:59:42,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 08:59:42,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 08:59:42,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 08:59:42,224 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 08:59:42,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:59:42" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 08:59:42,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 08:59:42,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 08:59:42,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 08:59:42,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 08:59:42,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 08:59:42,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 08:59:42,621 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 08:59:42,621 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 08:59:42,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:59:42 BoogieIcfgContainer [2020-06-22 08:59:42,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 08:59:42,623 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 08:59:42,624 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 08:59:42,626 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 08:59:42,626 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:59:42" (1/1) ... [2020-06-22 08:59:42,646 INFO L313 BlockEncoder]: Initial Icfg 63 locations, 67 edges [2020-06-22 08:59:42,648 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 08:59:42,649 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 08:59:42,649 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 08:59:42,650 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 08:59:42,651 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 08:59:42,652 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 08:59:42,652 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 08:59:42,680 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 08:59:42,718 INFO L200 BlockEncoder]: SBE split 34 edges [2020-06-22 08:59:42,723 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 08:59:42,725 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:59:42,785 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-06-22 08:59:42,788 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-06-22 08:59:42,789 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 08:59:42,790 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 08:59:42,790 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 08:59:42,791 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 08:59:42,791 INFO L313 BlockEncoder]: Encoded RCFG 53 locations, 91 edges [2020-06-22 08:59:42,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:59:42 BasicIcfg [2020-06-22 08:59:42,792 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 08:59:42,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 08:59:42,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 08:59:42,796 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 08:59:42,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 08:59:41" (1/4) ... [2020-06-22 08:59:42,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d498e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:59:42, skipping insertion in model container [2020-06-22 08:59:42,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:59:42" (2/4) ... [2020-06-22 08:59:42,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d498e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 08:59:42, skipping insertion in model container [2020-06-22 08:59:42,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:59:42" (3/4) ... [2020-06-22 08:59:42,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d498e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:59:42, skipping insertion in model container [2020-06-22 08:59:42,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:59:42" (4/4) ... [2020-06-22 08:59:42,800 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:59:42,810 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 08:59:42,818 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2020-06-22 08:59:42,834 INFO L257 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2020-06-22 08:59:42,863 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:59:42,863 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 08:59:42,864 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 08:59:42,864 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:59:42,864 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:59:42,864 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:59:42,864 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 08:59:42,864 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:59:42,864 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 08:59:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2020-06-22 08:59:42,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 08:59:42,886 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:59:42,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 08:59:42,887 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 08:59:42,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:59:42,892 INFO L82 PathProgramCache]: Analyzing trace with hash 166667, now seen corresponding path program 1 times [2020-06-22 08:59:42,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:59:42,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:59:42,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:42,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:59:42,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:59:43,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:59:43,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:59:43,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:59:43,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:59:43,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:59:43,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:59:43,087 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2020-06-22 08:59:43,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:59:43,270 INFO L93 Difference]: Finished difference Result 53 states and 91 transitions. [2020-06-22 08:59:43,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:59:43,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 08:59:43,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:59:43,286 INFO L225 Difference]: With dead ends: 53 [2020-06-22 08:59:43,286 INFO L226 Difference]: Without dead ends: 51 [2020-06-22 08:59:43,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:59:43,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-06-22 08:59:43,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-06-22 08:59:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-06-22 08:59:43,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 87 transitions. [2020-06-22 08:59:43,331 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 87 transitions. Word has length 3 [2020-06-22 08:59:43,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:59:43,333 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 87 transitions. [2020-06-22 08:59:43,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:59:43,333 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 87 transitions. [2020-06-22 08:59:43,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 08:59:43,333 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:59:43,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 08:59:43,334 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 08:59:43,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:59:43,334 INFO L82 PathProgramCache]: Analyzing trace with hash 166669, now seen corresponding path program 1 times [2020-06-22 08:59:43,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:59:43,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:59:43,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:43,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:59:43,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:59:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:59:43,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:59:43,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:59:43,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:59:43,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:59:43,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:59:43,373 INFO L87 Difference]: Start difference. First operand 51 states and 87 transitions. Second operand 3 states. [2020-06-22 08:59:43,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:59:43,514 INFO L93 Difference]: Finished difference Result 51 states and 87 transitions. [2020-06-22 08:59:43,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:59:43,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 08:59:43,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:59:43,516 INFO L225 Difference]: With dead ends: 51 [2020-06-22 08:59:43,516 INFO L226 Difference]: Without dead ends: 49 [2020-06-22 08:59:43,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:59:43,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-06-22 08:59:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-06-22 08:59:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-06-22 08:59:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 83 transitions. [2020-06-22 08:59:43,523 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 83 transitions. Word has length 3 [2020-06-22 08:59:43,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:59:43,524 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 83 transitions. [2020-06-22 08:59:43,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:59:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 83 transitions. [2020-06-22 08:59:43,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 08:59:43,524 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:59:43,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 08:59:43,525 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 08:59:43,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:59:43,525 INFO L82 PathProgramCache]: Analyzing trace with hash 5168924, now seen corresponding path program 1 times [2020-06-22 08:59:43,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:59:43,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:59:43,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:43,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:59:43,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:59:43,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:59:43,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:59:43,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:59:43,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:59:43,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:59:43,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:59:43,553 INFO L87 Difference]: Start difference. First operand 49 states and 83 transitions. Second operand 3 states. [2020-06-22 08:59:43,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:59:43,694 INFO L93 Difference]: Finished difference Result 49 states and 83 transitions. [2020-06-22 08:59:43,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:59:43,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 08:59:43,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:59:43,696 INFO L225 Difference]: With dead ends: 49 [2020-06-22 08:59:43,696 INFO L226 Difference]: Without dead ends: 47 [2020-06-22 08:59:43,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:59:43,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-06-22 08:59:43,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-06-22 08:59:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-06-22 08:59:43,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 79 transitions. [2020-06-22 08:59:43,702 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 79 transitions. Word has length 4 [2020-06-22 08:59:43,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:59:43,703 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 79 transitions. [2020-06-22 08:59:43,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:59:43,703 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 79 transitions. [2020-06-22 08:59:43,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 08:59:43,703 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:59:43,703 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 08:59:43,704 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 08:59:43,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:59:43,704 INFO L82 PathProgramCache]: Analyzing trace with hash 5168926, now seen corresponding path program 1 times [2020-06-22 08:59:43,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:59:43,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:59:43,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:43,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:59:43,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:59:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:59:43,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:59:43,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:59:43,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:59:43,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:59:43,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:59:43,731 INFO L87 Difference]: Start difference. First operand 47 states and 79 transitions. Second operand 3 states. [2020-06-22 08:59:43,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:59:43,845 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2020-06-22 08:59:43,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:59:43,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 08:59:43,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:59:43,846 INFO L225 Difference]: With dead ends: 49 [2020-06-22 08:59:43,847 INFO L226 Difference]: Without dead ends: 47 [2020-06-22 08:59:43,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:59:43,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-06-22 08:59:43,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-06-22 08:59:43,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-06-22 08:59:43,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 77 transitions. [2020-06-22 08:59:43,852 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 77 transitions. Word has length 4 [2020-06-22 08:59:43,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:59:43,853 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 77 transitions. [2020-06-22 08:59:43,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:59:43,853 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 77 transitions. [2020-06-22 08:59:43,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 08:59:43,853 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:59:43,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 08:59:43,854 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 08:59:43,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:59:43,855 INFO L82 PathProgramCache]: Analyzing trace with hash 5168927, now seen corresponding path program 1 times [2020-06-22 08:59:43,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:59:43,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:59:43,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:43,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:59:43,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:43,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:59:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:59:43,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:59:43,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:59:43,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:59:43,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:59:43,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:59:43,890 INFO L87 Difference]: Start difference. First operand 47 states and 77 transitions. Second operand 3 states. [2020-06-22 08:59:44,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:59:44,008 INFO L93 Difference]: Finished difference Result 47 states and 77 transitions. [2020-06-22 08:59:44,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:59:44,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 08:59:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:59:44,010 INFO L225 Difference]: With dead ends: 47 [2020-06-22 08:59:44,010 INFO L226 Difference]: Without dead ends: 45 [2020-06-22 08:59:44,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:59:44,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-06-22 08:59:44,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-06-22 08:59:44,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-06-22 08:59:44,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 75 transitions. [2020-06-22 08:59:44,016 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 75 transitions. Word has length 4 [2020-06-22 08:59:44,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:59:44,016 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 75 transitions. [2020-06-22 08:59:44,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:59:44,016 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 75 transitions. [2020-06-22 08:59:44,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 08:59:44,017 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:59:44,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:59:44,017 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 08:59:44,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:59:44,017 INFO L82 PathProgramCache]: Analyzing trace with hash 747729089, now seen corresponding path program 1 times [2020-06-22 08:59:44,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:59:44,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:59:44,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:44,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:59:44,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:59:44,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:59:44,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:59:44,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:59:44,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:59:44,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:59:44,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:59:44,046 INFO L87 Difference]: Start difference. First operand 45 states and 75 transitions. Second operand 3 states. [2020-06-22 08:59:44,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:59:44,166 INFO L93 Difference]: Finished difference Result 83 states and 138 transitions. [2020-06-22 08:59:44,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:59:44,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-06-22 08:59:44,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:59:44,167 INFO L225 Difference]: With dead ends: 83 [2020-06-22 08:59:44,167 INFO L226 Difference]: Without dead ends: 47 [2020-06-22 08:59:44,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:59:44,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-06-22 08:59:44,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2020-06-22 08:59:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-06-22 08:59:44,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 76 transitions. [2020-06-22 08:59:44,173 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 76 transitions. Word has length 9 [2020-06-22 08:59:44,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:59:44,174 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 76 transitions. [2020-06-22 08:59:44,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:59:44,174 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 76 transitions. [2020-06-22 08:59:44,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-06-22 08:59:44,175 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:59:44,175 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:59:44,175 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 08:59:44,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:59:44,176 INFO L82 PathProgramCache]: Analyzing trace with hash 747758880, now seen corresponding path program 1 times [2020-06-22 08:59:44,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:59:44,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:59:44,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:44,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:59:44,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:59:44,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:59:44,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:59:44,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:59:44,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 08:59:44,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:59:44,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:59:44,208 INFO L87 Difference]: Start difference. First operand 46 states and 76 transitions. Second operand 3 states. [2020-06-22 08:59:44,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:59:44,295 INFO L93 Difference]: Finished difference Result 85 states and 140 transitions. [2020-06-22 08:59:44,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:59:44,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-06-22 08:59:44,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:59:44,297 INFO L225 Difference]: With dead ends: 85 [2020-06-22 08:59:44,297 INFO L226 Difference]: Without dead ends: 45 [2020-06-22 08:59:44,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:59:44,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-06-22 08:59:44,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-06-22 08:59:44,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-06-22 08:59:44,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2020-06-22 08:59:44,302 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 9 [2020-06-22 08:59:44,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:59:44,302 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2020-06-22 08:59:44,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 08:59:44,303 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2020-06-22 08:59:44,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 08:59:44,303 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:59:44,303 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:59:44,303 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 08:59:44,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:59:44,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1307403252, now seen corresponding path program 1 times [2020-06-22 08:59:44,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:59:44,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:59:44,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:44,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:59:44,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:59:44,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:59:44,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:59:44,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:59:44,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:59:44,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:59:44,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:59:44,343 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand 4 states. [2020-06-22 08:59:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:59:44,447 INFO L93 Difference]: Finished difference Result 45 states and 72 transitions. [2020-06-22 08:59:44,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:59:44,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-06-22 08:59:44,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:59:44,448 INFO L225 Difference]: With dead ends: 45 [2020-06-22 08:59:44,448 INFO L226 Difference]: Without dead ends: 39 [2020-06-22 08:59:44,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:59:44,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-06-22 08:59:44,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-06-22 08:59:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-06-22 08:59:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 60 transitions. [2020-06-22 08:59:44,453 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 60 transitions. Word has length 11 [2020-06-22 08:59:44,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:59:44,453 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 60 transitions. [2020-06-22 08:59:44,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:59:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 60 transitions. [2020-06-22 08:59:44,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-06-22 08:59:44,454 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:59:44,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:59:44,454 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 08:59:44,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:59:44,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1307403254, now seen corresponding path program 1 times [2020-06-22 08:59:44,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:59:44,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:59:44,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:44,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:59:44,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:59:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:59:44,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:59:44,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:59:44,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:59:44,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:59:44,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:59:44,503 INFO L87 Difference]: Start difference. First operand 39 states and 60 transitions. Second operand 4 states. [2020-06-22 08:59:44,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:59:44,604 INFO L93 Difference]: Finished difference Result 39 states and 60 transitions. [2020-06-22 08:59:44,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:59:44,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-06-22 08:59:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:59:44,625 INFO L225 Difference]: With dead ends: 39 [2020-06-22 08:59:44,625 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 08:59:44,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:59:44,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 08:59:44,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-06-22 08:59:44,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-06-22 08:59:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2020-06-22 08:59:44,629 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 11 [2020-06-22 08:59:44,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:59:44,629 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2020-06-22 08:59:44,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:59:44,629 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2020-06-22 08:59:44,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 08:59:44,630 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:59:44,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:59:44,630 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 08:59:44,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:59:44,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1874792366, now seen corresponding path program 1 times [2020-06-22 08:59:44,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:59:44,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:59:44,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:44,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:59:44,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:59:44,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:59:44,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:59:44,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:59:44,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:59:44,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:59:44,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:59:44,665 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 4 states. [2020-06-22 08:59:44,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:59:44,729 INFO L93 Difference]: Finished difference Result 32 states and 47 transitions. [2020-06-22 08:59:44,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:59:44,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-06-22 08:59:44,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:59:44,730 INFO L225 Difference]: With dead ends: 32 [2020-06-22 08:59:44,730 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 08:59:44,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:59:44,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 08:59:44,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-06-22 08:59:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 08:59:44,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-06-22 08:59:44,734 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 12 [2020-06-22 08:59:44,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:59:44,734 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-06-22 08:59:44,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:59:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-06-22 08:59:44,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 08:59:44,735 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 08:59:44,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:59:44,735 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-06-22 08:59:44,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:59:44,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1874792368, now seen corresponding path program 1 times [2020-06-22 08:59:44,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:59:44,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:59:44,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:44,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:59:44,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:59:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:59:44,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:59:44,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 08:59:44,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 08:59:44,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 08:59:44,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 08:59:44,780 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2020-06-22 08:59:44,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:59:44,841 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2020-06-22 08:59:44,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 08:59:44,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-06-22 08:59:44,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 08:59:44,842 INFO L225 Difference]: With dead ends: 27 [2020-06-22 08:59:44,842 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 08:59:44,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 08:59:44,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 08:59:44,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 08:59:44,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 08:59:44,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 08:59:44,843 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2020-06-22 08:59:44,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 08:59:44,844 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 08:59:44,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 08:59:44,844 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 08:59:44,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 08:59:44,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 08:59:44,914 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2020-06-22 08:59:44,914 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2020-06-22 08:59:44,915 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2020-06-22 08:59:44,915 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 23) no Hoare annotation was computed. [2020-06-22 08:59:44,915 INFO L444 ceAbstractionStarter]: At program point L19-4(lines 18 24) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_main_~y1~0.base)) (= 1 (select |#valid| ULTIMATE.start_gcd_~y2.base)) (= 4 (select |#length| ULTIMATE.start_gcd_~y2.base)) (= (select |#length| ULTIMATE.start_main_~y1~0.base) 4) (= 0 ULTIMATE.start_main_~y2~0.offset) (= 4 (select |#length| ULTIMATE.start_gcd_~y1.base)) (= 0 ULTIMATE.start_gcd_~y1.offset) (= (select |#valid| ULTIMATE.start_gcd_~y1.base) 1) (= 0 ULTIMATE.start_main_~y1~0.offset) (= ULTIMATE.start_gcd_~y2.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~y2~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~y2~0.base))) [2020-06-22 08:59:44,915 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-06-22 08:59:44,915 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2020-06-22 08:59:44,916 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 08:59:44,916 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 08:59:44,916 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. [2020-06-22 08:59:44,916 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-06-22 08:59:44,916 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 08:59:44,916 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 08:59:44,916 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. [2020-06-22 08:59:44,916 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2020-06-22 08:59:44,916 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-06-22 08:59:44,917 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 08:59:44,917 INFO L448 ceAbstractionStarter]: For program point L20-2(line 20) no Hoare annotation was computed. [2020-06-22 08:59:44,917 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 08:59:44,917 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 08:59:44,917 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 08:59:44,917 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 08:59:44,917 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 08:59:44,917 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-06-22 08:59:44,917 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 08:59:44,918 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 08:59:44,918 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2020-06-22 08:59:44,918 INFO L448 ceAbstractionStarter]: For program point L33-1(line 33) no Hoare annotation was computed. [2020-06-22 08:59:44,918 INFO L448 ceAbstractionStarter]: For program point L33-2(line 33) no Hoare annotation was computed. [2020-06-22 08:59:44,918 INFO L448 ceAbstractionStarter]: For program point L33-3(line 33) no Hoare annotation was computed. [2020-06-22 08:59:44,918 INFO L448 ceAbstractionStarter]: For program point L33-4(line 33) no Hoare annotation was computed. [2020-06-22 08:59:44,918 INFO L448 ceAbstractionStarter]: For program point L33-6(lines 33 35) no Hoare annotation was computed. [2020-06-22 08:59:44,918 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. [2020-06-22 08:59:44,918 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. [2020-06-22 08:59:44,919 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 32) no Hoare annotation was computed. [2020-06-22 08:59:44,919 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 08:59:44,919 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 08:59:44,919 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 33) no Hoare annotation was computed. [2020-06-22 08:59:44,919 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2020-06-22 08:59:44,919 INFO L448 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2020-06-22 08:59:44,919 INFO L448 ceAbstractionStarter]: For program point L22-2(line 22) no Hoare annotation was computed. [2020-06-22 08:59:44,919 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 08:59:44,919 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-06-22 08:59:44,920 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 08:59:44,920 INFO L448 ceAbstractionStarter]: For program point L18-2(lines 18 24) no Hoare annotation was computed. [2020-06-22 08:59:44,920 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 08:59:44,920 INFO L448 ceAbstractionStarter]: For program point L18-4(lines 18 24) no Hoare annotation was computed. [2020-06-22 08:59:44,920 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-06-22 08:59:44,920 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-06-22 08:59:44,920 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 08:59:44,920 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 25) no Hoare annotation was computed. [2020-06-22 08:59:44,920 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 08:59:44,921 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. [2020-06-22 08:59:44,921 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 08:59:44,931 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:59:44,932 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:59:44,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:59:44,933 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:59:44,939 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:59:44,940 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:59:44,940 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:59:44,940 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:59:44,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:59:44 BasicIcfg [2020-06-22 08:59:44,943 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 08:59:44,943 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 08:59:44,944 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 08:59:44,947 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 08:59:44,948 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:59:44,948 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 08:59:41" (1/5) ... [2020-06-22 08:59:44,948 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c072fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:59:44, skipping insertion in model container [2020-06-22 08:59:44,949 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:59:44,949 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 08:59:42" (2/5) ... [2020-06-22 08:59:44,949 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c072fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 08:59:44, skipping insertion in model container [2020-06-22 08:59:44,949 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:59:44,949 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 08:59:42" (3/5) ... [2020-06-22 08:59:44,949 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c072fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:59:44, skipping insertion in model container [2020-06-22 08:59:44,950 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:59:44,950 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 08:59:42" (4/5) ... [2020-06-22 08:59:44,950 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c072fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:59:44, skipping insertion in model container [2020-06-22 08:59:44,950 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 08:59:44,950 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 08:59:44" (5/5) ... [2020-06-22 08:59:44,952 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 08:59:44,973 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 08:59:44,974 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 08:59:44,974 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 08:59:44,974 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 08:59:44,974 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 08:59:44,974 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 08:59:44,974 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 08:59:44,974 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 08:59:44,974 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 08:59:44,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states. [2020-06-22 08:59:44,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 08:59:44,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:59:44,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:59:44,989 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:59:44,989 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:59:44,989 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 08:59:44,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states. [2020-06-22 08:59:44,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 08:59:44,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:59:44,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:59:44,993 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:59:44,993 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:59:44,998 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue [136] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 13#L-1true [196] L-1-->L31: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc10.base_1| 0) (< |v_ULTIMATE.start_main_#t~malloc9.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc9.base_1| 4) |v_ULTIMATE.start_main_#t~malloc10.base_1| 4)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1|) 0) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1|) 0) (= |v_ULTIMATE.start_main_#t~malloc9.offset_1| 0) (= v_ULTIMATE.start_main_~y2~0.offset_1 |v_ULTIMATE.start_main_#t~malloc10.offset_1|) (= v_ULTIMATE.start_main_~y1~0.offset_1 |v_ULTIMATE.start_main_#t~malloc9.offset_1|) (= v_ULTIMATE.start_main_~y1~0.base_1 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= v_ULTIMATE.start_main_~y2~0.base_1 |v_ULTIMATE.start_main_#t~malloc10.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_1, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_1|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_1, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~y2~0.base, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_~y1~0.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_~y1~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~short15, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~y2~0.offset, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~malloc10.offset] 49#L31true [263] L31-->L32: Formula: (and (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y1~0.base_11 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y1~0.base_11) v_ULTIMATE.start_main_~y1~0.offset_9 |v_ULTIMATE.start_main_#t~nondet11_5|)) |v_#memory_int_20|) (<= 0 v_ULTIMATE.start_main_~y1~0.offset_9) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~y1~0.base_11)) (<= (+ v_ULTIMATE.start_main_~y1~0.offset_9 4) (select |v_#length_34| v_ULTIMATE.start_main_~y1~0.base_11))) InVars {ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_9, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_11, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_9, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_11, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, #memory_int] 14#L32true [264] L32-->L33: Formula: (and (<= 0 v_ULTIMATE.start_main_~y2~0.offset_9) (<= (+ v_ULTIMATE.start_main_~y2~0.offset_9 4) (select |v_#length_35| v_ULTIMATE.start_main_~y2~0.base_11)) (= 1 (select |v_#valid_40| v_ULTIMATE.start_main_~y2~0.base_11)) (= (store |v_#memory_int_23| v_ULTIMATE.start_main_~y2~0.base_11 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~y2~0.base_11) v_ULTIMATE.start_main_~y2~0.offset_9 |v_ULTIMATE.start_main_#t~nondet12_5|)) |v_#memory_int_22|)) InVars {ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_11, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_9} OutVars{ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_11, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12, #memory_int] 34#L33true [141] L33-->L33-1: Formula: (and (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~y1~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y1~0.base_7) v_ULTIMATE.start_main_~y1~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y1~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y1~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~y1~0.base_7))) InVars {ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_7, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_6, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_6, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, #valid=|v_#valid_10|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_7, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 32#L33-1true [210] L33-1-->L33-2: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~mem13_3|) (not |v_ULTIMATE.start_main_#t~short15_2|)) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short15] 29#L33-2true [132] L33-2-->L33-6: Formula: (not |v_ULTIMATE.start_main_#t~short15_5|) InVars {ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_5|} OutVars{ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_5|} AuxVars[] AssignedVars[] 6#L33-6true [93] L33-6-->L19-4: Formula: (and |v_ULTIMATE.start_main_#t~short15_7| (= |v_ULTIMATE.start_gcd_#in~y1.base_1| v_ULTIMATE.start_main_~y1~0.base_10) (= |v_ULTIMATE.start_gcd_#in~y1.offset_1| v_ULTIMATE.start_main_~y1~0.offset_8) (= v_ULTIMATE.start_gcd_~y1.offset_1 |v_ULTIMATE.start_gcd_#in~y1.offset_1|) (= v_ULTIMATE.start_gcd_~y2.offset_1 |v_ULTIMATE.start_gcd_#in~y2.offset_1|) (= v_ULTIMATE.start_gcd_~y2.base_1 |v_ULTIMATE.start_gcd_#in~y2.base_1|) (= |v_ULTIMATE.start_gcd_#in~y2.offset_1| v_ULTIMATE.start_main_~y2~0.offset_8) (= v_ULTIMATE.start_gcd_~y1.base_1 |v_ULTIMATE.start_gcd_#in~y1.base_1|) (= |v_ULTIMATE.start_gcd_#in~y2.base_1| v_ULTIMATE.start_main_~y2~0.base_10)) InVars {ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_10, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_8, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_8, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_10, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_7|} OutVars{ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_10, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_1, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_1, ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_1|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_1|, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_8, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_1|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_1|, ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_1|, ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_1|, ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_1|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_1|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_6|, ULTIMATE.start_gcd_#in~y2.offset=|v_ULTIMATE.start_gcd_#in~y2.offset_1|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_gcd_#in~y1.base=|v_ULTIMATE.start_gcd_#in~y1.base_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|, ULTIMATE.start_gcd_#in~y1.offset=|v_ULTIMATE.start_gcd_#in~y1.offset_1|, ULTIMATE.start_gcd_#in~y2.base=|v_ULTIMATE.start_gcd_#in~y2.base_1|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_10, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_1, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_1|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_1, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#in~y1.base, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_gcd_#in~y1.offset, ULTIMATE.start_gcd_#in~y2.base, ULTIMATE.start_gcd_~y2.base, ULTIMATE.start_gcd_~y1.base, ULTIMATE.start_gcd_~y1.offset, ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4, ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, ULTIMATE.start_gcd_#t~mem1, ULTIMATE.start_gcd_#t~mem0, ULTIMATE.start_gcd_#res, ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_~y2.offset, ULTIMATE.start_gcd_#t~mem2, ULTIMATE.start_main_#t~short15, ULTIMATE.start_gcd_#in~y2.offset, ULTIMATE.start_gcd_#t~mem8, ULTIMATE.start_main_#t~mem14] 19#L19-4true [2020-06-22 08:59:44,999 INFO L796 eck$LassoCheckResult]: Loop: 19#L19-4true [120] L19-4-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y1.offset_3) (= 1 (select |v_#valid_14| v_ULTIMATE.start_gcd_~y1.base_3)) (= |v_ULTIMATE.start_gcd_#t~mem0_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_gcd_~y1.base_3) v_ULTIMATE.start_gcd_~y1.offset_3)) (<= (+ v_ULTIMATE.start_gcd_~y1.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_gcd_~y1.base_3))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_3, #length=|v_#length_12|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_3, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_3, #length=|v_#length_12|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem0] 8#L18-1true [95] L18-1-->L18-2: Formula: (and (= (select |v_#valid_16| v_ULTIMATE.start_gcd_~y2.base_3) 1) (<= (+ v_ULTIMATE.start_gcd_~y2.offset_3 4) (select |v_#length_14| v_ULTIMATE.start_gcd_~y2.base_3)) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_3) (= |v_ULTIMATE.start_gcd_#t~mem1_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_gcd_~y2.base_3) v_ULTIMATE.start_gcd_~y2.offset_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_3, #length=|v_#length_14|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_3, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_2|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_3, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_3, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem1] 4#L18-2true [229] L18-2-->L19: Formula: (< |v_ULTIMATE.start_gcd_#t~mem1_6| |v_ULTIMATE.start_gcd_#t~mem0_6|) InVars {ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_6|, ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_6|} OutVars{ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_5|, ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem1, ULTIMATE.start_gcd_#t~mem0] 26#L19true [128] L19-->L19-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y1.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_gcd_~y1.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem2_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_gcd_~y1.base_6) v_ULTIMATE.start_gcd_~y1.offset_5)) (<= 0 v_ULTIMATE.start_gcd_~y1.offset_5) (= (select |v_#valid_18| v_ULTIMATE.start_gcd_~y1.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_6, #length=|v_#length_16|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_5, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_6, #length=|v_#length_16|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem2] 22#L19-1true [125] L19-1-->L19-2: Formula: (and (= |v_ULTIMATE.start_gcd_#t~mem3_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_gcd_~y2.base_6) v_ULTIMATE.start_gcd_~y2.offset_5)) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_5) (= 1 (select |v_#valid_20| v_ULTIMATE.start_gcd_~y2.base_6)) (<= (+ v_ULTIMATE.start_gcd_~y2.offset_5 4) (select |v_#length_18| v_ULTIMATE.start_gcd_~y2.base_6))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_6, #length=|v_#length_18|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_5, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_2|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_5, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_6, #length=|v_#length_18|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 21#L19-2true [180] L19-2-->L22: Formula: (>= |v_ULTIMATE.start_gcd_#t~mem3_6| |v_ULTIMATE.start_gcd_#t~mem2_6|) InVars {ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_6|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_6|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_5|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_#t~mem2] 33#L22true [138] L22-->L22-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y2.offset_9 4) (select |v_#length_26| v_ULTIMATE.start_gcd_~y2.base_12)) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_9) (= (select |v_#valid_28| v_ULTIMATE.start_gcd_~y2.base_12) 1) (= (select (select |v_#memory_int_15| v_ULTIMATE.start_gcd_~y2.base_12) v_ULTIMATE.start_gcd_~y2.offset_9) |v_ULTIMATE.start_gcd_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_12, #length=|v_#length_26|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_9, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_2|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_12, #length=|v_#length_26|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem6] 30#L22-1true [133] L22-1-->L22-2: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y1.offset_11) (= |v_ULTIMATE.start_gcd_#t~mem7_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_gcd_~y1.base_15) v_ULTIMATE.start_gcd_~y1.offset_11)) (<= (+ v_ULTIMATE.start_gcd_~y1.offset_11 4) (select |v_#length_28| v_ULTIMATE.start_gcd_~y1.base_15)) (= 1 (select |v_#valid_30| v_ULTIMATE.start_gcd_~y1.base_15))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_15, #length=|v_#length_28|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_11, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_2|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_15, #length=|v_#length_28|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7] 12#L22-2true [270] L22-2-->L19-4: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_gcd_~y2.base_18) 1) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_13) (= (store |v_#memory_int_29| v_ULTIMATE.start_gcd_~y2.base_18 (store (select |v_#memory_int_29| v_ULTIMATE.start_gcd_~y2.base_18) v_ULTIMATE.start_gcd_~y2.offset_13 (+ |v_ULTIMATE.start_gcd_#t~mem6_6| (* (- 1) |v_ULTIMATE.start_gcd_#t~mem7_6|)))) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_gcd_~y2.offset_13 4) (select |v_#length_39| v_ULTIMATE.start_gcd_~y2.base_18))) InVars {ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_6|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_6|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_13, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_18, #length=|v_#length_39|} OutVars{ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_5|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_5|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_13, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_18, #length=|v_#length_39|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, #memory_int] 19#L19-4true [2020-06-22 08:59:45,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:59:45,001 INFO L82 PathProgramCache]: Analyzing trace with hash 331327644, now seen corresponding path program 1 times [2020-06-22 08:59:45,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:59:45,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:59:45,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:45,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:59:45,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:59:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:59:45,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:59:45,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 08:59:45,021 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 08:59:45,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:59:45,021 INFO L82 PathProgramCache]: Analyzing trace with hash 880923897, now seen corresponding path program 1 times [2020-06-22 08:59:45,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:59:45,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:59:45,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:45,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:59:45,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:59:45,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:59:45,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:59:45,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 08:59:45,072 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 08:59:45,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 08:59:45,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 08:59:45,074 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 3 states. [2020-06-22 08:59:45,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:59:45,182 INFO L93 Difference]: Finished difference Result 55 states and 92 transitions. [2020-06-22 08:59:45,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 08:59:45,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 92 transitions. [2020-06-22 08:59:45,187 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 08:59:45,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 22 states and 27 transitions. [2020-06-22 08:59:45,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-06-22 08:59:45,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-06-22 08:59:45,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2020-06-22 08:59:45,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:59:45,190 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-06-22 08:59:45,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2020-06-22 08:59:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-06-22 08:59:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 08:59:45,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-06-22 08:59:45,192 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-06-22 08:59:45,192 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-06-22 08:59:45,192 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 08:59:45,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2020-06-22 08:59:45,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-06-22 08:59:45,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:59:45,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:59:45,194 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:59:45,194 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:59:45,195 INFO L794 eck$LassoCheckResult]: Stem: 141#ULTIMATE.startENTRY [136] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 136#L-1 [196] L-1-->L31: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc10.base_1| 0) (< |v_ULTIMATE.start_main_#t~malloc9.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc9.base_1| 4) |v_ULTIMATE.start_main_#t~malloc10.base_1| 4)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1|) 0) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1|) 0) (= |v_ULTIMATE.start_main_#t~malloc9.offset_1| 0) (= v_ULTIMATE.start_main_~y2~0.offset_1 |v_ULTIMATE.start_main_#t~malloc10.offset_1|) (= v_ULTIMATE.start_main_~y1~0.offset_1 |v_ULTIMATE.start_main_#t~malloc9.offset_1|) (= v_ULTIMATE.start_main_~y1~0.base_1 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= v_ULTIMATE.start_main_~y2~0.base_1 |v_ULTIMATE.start_main_#t~malloc10.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_1, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_1|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_1, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~y2~0.base, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_~y1~0.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_~y1~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~short15, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~y2~0.offset, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~malloc10.offset] 137#L31 [263] L31-->L32: Formula: (and (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y1~0.base_11 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y1~0.base_11) v_ULTIMATE.start_main_~y1~0.offset_9 |v_ULTIMATE.start_main_#t~nondet11_5|)) |v_#memory_int_20|) (<= 0 v_ULTIMATE.start_main_~y1~0.offset_9) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~y1~0.base_11)) (<= (+ v_ULTIMATE.start_main_~y1~0.offset_9 4) (select |v_#length_34| v_ULTIMATE.start_main_~y1~0.base_11))) InVars {ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_9, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_11, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_9, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_11, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, #memory_int] 138#L32 [264] L32-->L33: Formula: (and (<= 0 v_ULTIMATE.start_main_~y2~0.offset_9) (<= (+ v_ULTIMATE.start_main_~y2~0.offset_9 4) (select |v_#length_35| v_ULTIMATE.start_main_~y2~0.base_11)) (= 1 (select |v_#valid_40| v_ULTIMATE.start_main_~y2~0.base_11)) (= (store |v_#memory_int_23| v_ULTIMATE.start_main_~y2~0.base_11 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~y2~0.base_11) v_ULTIMATE.start_main_~y2~0.offset_9 |v_ULTIMATE.start_main_#t~nondet12_5|)) |v_#memory_int_22|)) InVars {ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_11, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_9} OutVars{ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_11, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12, #memory_int] 142#L33 [141] L33-->L33-1: Formula: (and (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~y1~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y1~0.base_7) v_ULTIMATE.start_main_~y1~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y1~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y1~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~y1~0.base_7))) InVars {ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_7, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_6, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_6, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, #valid=|v_#valid_10|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_7, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 143#L33-1 [209] L33-1-->L33-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem13_3|) |v_ULTIMATE.start_main_#t~short15_2|) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short15] 139#L33-2 [131] L33-2-->L33-3: Formula: |v_ULTIMATE.start_main_#t~short15_3| InVars {ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_3|} OutVars{ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_3|} AuxVars[] AssignedVars[] 134#L33-3 [100] L33-3-->L33-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y2~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem14_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~y2~0.base_7) v_ULTIMATE.start_main_~y2~0.offset_6)) (= (select |v_#valid_12| v_ULTIMATE.start_main_~y2~0.base_7) 1) (<= (+ v_ULTIMATE.start_main_~y2~0.offset_6 4) (select |v_#length_10| v_ULTIMATE.start_main_~y2~0.base_7))) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_6, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_7, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_7, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_6, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 132#L33-4 [216] L33-4-->L33-6: Formula: (and |v_ULTIMATE.start_main_#t~short15_4| (<= 0 |v_ULTIMATE.start_main_#t~mem14_3|)) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short15] 126#L33-6 [93] L33-6-->L19-4: Formula: (and |v_ULTIMATE.start_main_#t~short15_7| (= |v_ULTIMATE.start_gcd_#in~y1.base_1| v_ULTIMATE.start_main_~y1~0.base_10) (= |v_ULTIMATE.start_gcd_#in~y1.offset_1| v_ULTIMATE.start_main_~y1~0.offset_8) (= v_ULTIMATE.start_gcd_~y1.offset_1 |v_ULTIMATE.start_gcd_#in~y1.offset_1|) (= v_ULTIMATE.start_gcd_~y2.offset_1 |v_ULTIMATE.start_gcd_#in~y2.offset_1|) (= v_ULTIMATE.start_gcd_~y2.base_1 |v_ULTIMATE.start_gcd_#in~y2.base_1|) (= |v_ULTIMATE.start_gcd_#in~y2.offset_1| v_ULTIMATE.start_main_~y2~0.offset_8) (= v_ULTIMATE.start_gcd_~y1.base_1 |v_ULTIMATE.start_gcd_#in~y1.base_1|) (= |v_ULTIMATE.start_gcd_#in~y2.base_1| v_ULTIMATE.start_main_~y2~0.base_10)) InVars {ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_10, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_8, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_8, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_10, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_7|} OutVars{ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_10, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_1, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_1, ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_1|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_1|, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_8, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_1|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_1|, ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_1|, ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_1|, ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_1|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_1|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_6|, ULTIMATE.start_gcd_#in~y2.offset=|v_ULTIMATE.start_gcd_#in~y2.offset_1|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_gcd_#in~y1.base=|v_ULTIMATE.start_gcd_#in~y1.base_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|, ULTIMATE.start_gcd_#in~y1.offset=|v_ULTIMATE.start_gcd_#in~y1.offset_1|, ULTIMATE.start_gcd_#in~y2.base=|v_ULTIMATE.start_gcd_#in~y2.base_1|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_10, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_1, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_1|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_1, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#in~y1.base, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_gcd_#in~y1.offset, ULTIMATE.start_gcd_#in~y2.base, ULTIMATE.start_gcd_~y2.base, ULTIMATE.start_gcd_~y1.base, ULTIMATE.start_gcd_~y1.offset, ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4, ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, ULTIMATE.start_gcd_#t~mem1, ULTIMATE.start_gcd_#t~mem0, ULTIMATE.start_gcd_#res, ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_~y2.offset, ULTIMATE.start_gcd_#t~mem2, ULTIMATE.start_main_#t~short15, ULTIMATE.start_gcd_#in~y2.offset, ULTIMATE.start_gcd_#t~mem8, ULTIMATE.start_main_#t~mem14] 122#L19-4 [2020-06-22 08:59:45,195 INFO L796 eck$LassoCheckResult]: Loop: 122#L19-4 [120] L19-4-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y1.offset_3) (= 1 (select |v_#valid_14| v_ULTIMATE.start_gcd_~y1.base_3)) (= |v_ULTIMATE.start_gcd_#t~mem0_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_gcd_~y1.base_3) v_ULTIMATE.start_gcd_~y1.offset_3)) (<= (+ v_ULTIMATE.start_gcd_~y1.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_gcd_~y1.base_3))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_3, #length=|v_#length_12|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_3, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_3, #length=|v_#length_12|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem0] 123#L18-1 [95] L18-1-->L18-2: Formula: (and (= (select |v_#valid_16| v_ULTIMATE.start_gcd_~y2.base_3) 1) (<= (+ v_ULTIMATE.start_gcd_~y2.offset_3 4) (select |v_#length_14| v_ULTIMATE.start_gcd_~y2.base_3)) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_3) (= |v_ULTIMATE.start_gcd_#t~mem1_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_gcd_~y2.base_3) v_ULTIMATE.start_gcd_~y2.offset_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_3, #length=|v_#length_14|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_3, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_2|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_3, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_3, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem1] 124#L18-2 [229] L18-2-->L19: Formula: (< |v_ULTIMATE.start_gcd_#t~mem1_6| |v_ULTIMATE.start_gcd_#t~mem0_6|) InVars {ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_6|, ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_6|} OutVars{ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_5|, ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem1, ULTIMATE.start_gcd_#t~mem0] 125#L19 [128] L19-->L19-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y1.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_gcd_~y1.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem2_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_gcd_~y1.base_6) v_ULTIMATE.start_gcd_~y1.offset_5)) (<= 0 v_ULTIMATE.start_gcd_~y1.offset_5) (= (select |v_#valid_18| v_ULTIMATE.start_gcd_~y1.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_6, #length=|v_#length_16|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_5, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_6, #length=|v_#length_16|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem2] 130#L19-1 [125] L19-1-->L19-2: Formula: (and (= |v_ULTIMATE.start_gcd_#t~mem3_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_gcd_~y2.base_6) v_ULTIMATE.start_gcd_~y2.offset_5)) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_5) (= 1 (select |v_#valid_20| v_ULTIMATE.start_gcd_~y2.base_6)) (<= (+ v_ULTIMATE.start_gcd_~y2.offset_5 4) (select |v_#length_18| v_ULTIMATE.start_gcd_~y2.base_6))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_6, #length=|v_#length_18|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_5, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_2|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_5, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_6, #length=|v_#length_18|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 127#L19-2 [180] L19-2-->L22: Formula: (>= |v_ULTIMATE.start_gcd_#t~mem3_6| |v_ULTIMATE.start_gcd_#t~mem2_6|) InVars {ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_6|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_6|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_5|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_#t~mem2] 128#L22 [138] L22-->L22-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y2.offset_9 4) (select |v_#length_26| v_ULTIMATE.start_gcd_~y2.base_12)) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_9) (= (select |v_#valid_28| v_ULTIMATE.start_gcd_~y2.base_12) 1) (= (select (select |v_#memory_int_15| v_ULTIMATE.start_gcd_~y2.base_12) v_ULTIMATE.start_gcd_~y2.offset_9) |v_ULTIMATE.start_gcd_#t~mem6_2|)) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_12, #length=|v_#length_26|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_9, #valid=|v_#valid_28|} OutVars{ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_2|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_9, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_12, #length=|v_#length_26|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem6] 140#L22-1 [133] L22-1-->L22-2: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y1.offset_11) (= |v_ULTIMATE.start_gcd_#t~mem7_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_gcd_~y1.base_15) v_ULTIMATE.start_gcd_~y1.offset_11)) (<= (+ v_ULTIMATE.start_gcd_~y1.offset_11 4) (select |v_#length_28| v_ULTIMATE.start_gcd_~y1.base_15)) (= 1 (select |v_#valid_30| v_ULTIMATE.start_gcd_~y1.base_15))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_15, #length=|v_#length_28|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_11, #valid=|v_#valid_30|} OutVars{ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_2|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_15, #length=|v_#length_28|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_11} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7] 135#L22-2 [270] L22-2-->L19-4: Formula: (and (= (select |v_#valid_48| v_ULTIMATE.start_gcd_~y2.base_18) 1) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_13) (= (store |v_#memory_int_29| v_ULTIMATE.start_gcd_~y2.base_18 (store (select |v_#memory_int_29| v_ULTIMATE.start_gcd_~y2.base_18) v_ULTIMATE.start_gcd_~y2.offset_13 (+ |v_ULTIMATE.start_gcd_#t~mem6_6| (* (- 1) |v_ULTIMATE.start_gcd_#t~mem7_6|)))) |v_#memory_int_28|) (<= (+ v_ULTIMATE.start_gcd_~y2.offset_13 4) (select |v_#length_39| v_ULTIMATE.start_gcd_~y2.base_18))) InVars {ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_6|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_6|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_13, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_18, #length=|v_#length_39|} OutVars{ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_5|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_5|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_13, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_18, #length=|v_#length_39|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, #memory_int] 122#L19-4 [2020-06-22 08:59:45,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:59:45,196 INFO L82 PathProgramCache]: Analyzing trace with hash 577346184, now seen corresponding path program 1 times [2020-06-22 08:59:45,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:59:45,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:59:45,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:45,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:59:45,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:45,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:59:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:59:45,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:59:45,239 INFO L82 PathProgramCache]: Analyzing trace with hash 880923897, now seen corresponding path program 2 times [2020-06-22 08:59:45,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:59:45,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:59:45,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:45,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:59:45,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 08:59:45,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 08:59:45,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 08:59:45,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 08:59:45,295 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 08:59:45,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 08:59:45,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-06-22 08:59:45,296 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 6 Second operand 7 states. [2020-06-22 08:59:45,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 08:59:45,411 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2020-06-22 08:59:45,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 08:59:45,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 33 transitions. [2020-06-22 08:59:45,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2020-06-22 08:59:45,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 33 transitions. [2020-06-22 08:59:45,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-06-22 08:59:45,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-06-22 08:59:45,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2020-06-22 08:59:45,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 08:59:45,415 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-06-22 08:59:45,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2020-06-22 08:59:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2020-06-22 08:59:45,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 08:59:45,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2020-06-22 08:59:45,417 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2020-06-22 08:59:45,417 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2020-06-22 08:59:45,417 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 08:59:45,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2020-06-22 08:59:45,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-06-22 08:59:45,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 08:59:45,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 08:59:45,419 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:59:45,419 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 08:59:45,420 INFO L794 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY [136] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 200#L-1 [196] L-1-->L31: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1| 1))) (and (< |v_ULTIMATE.start_main_#t~malloc10.base_1| 0) (< |v_ULTIMATE.start_main_#t~malloc9.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc10.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc9.base_1| 4) |v_ULTIMATE.start_main_#t~malloc10.base_1| 4)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc9.base_1|) 0) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc10.base_1|) 0) (= |v_ULTIMATE.start_main_#t~malloc9.offset_1| 0) (= v_ULTIMATE.start_main_~y2~0.offset_1 |v_ULTIMATE.start_main_#t~malloc10.offset_1|) (= v_ULTIMATE.start_main_~y1~0.offset_1 |v_ULTIMATE.start_main_#t~malloc9.offset_1|) (= v_ULTIMATE.start_main_~y1~0.base_1 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= v_ULTIMATE.start_main_~y2~0.base_1 |v_ULTIMATE.start_main_#t~malloc10.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc9.base_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc9.base=|v_ULTIMATE.start_main_#t~malloc9.base_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_1, ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_1|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_1, ULTIMATE.start_main_#t~ret16=|v_ULTIMATE.start_main_#t~ret16_1|, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~malloc9.offset=|v_ULTIMATE.start_main_#t~malloc9.offset_1|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_1, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc9.base, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_main_~y2~0.base, ULTIMATE.start_main_#t~nondet12, ULTIMATE.start_main_~y1~0.base, ULTIMATE.start_main_#t~ret16, ULTIMATE.start_main_~y1~0.offset, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~short15, #length, ULTIMATE.start_main_#t~malloc9.offset, ULTIMATE.start_main_~y2~0.offset, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~malloc10.offset] 201#L31 [263] L31-->L32: Formula: (and (= (store |v_#memory_int_21| v_ULTIMATE.start_main_~y1~0.base_11 (store (select |v_#memory_int_21| v_ULTIMATE.start_main_~y1~0.base_11) v_ULTIMATE.start_main_~y1~0.offset_9 |v_ULTIMATE.start_main_#t~nondet11_5|)) |v_#memory_int_20|) (<= 0 v_ULTIMATE.start_main_~y1~0.offset_9) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~y1~0.base_11)) (<= (+ v_ULTIMATE.start_main_~y1~0.offset_9 4) (select |v_#length_34| v_ULTIMATE.start_main_~y1~0.base_11))) InVars {ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_9, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_11, #length=|v_#length_34|} OutVars{ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_9, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_4|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_11, #length=|v_#length_34|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11, #memory_int] 202#L32 [264] L32-->L33: Formula: (and (<= 0 v_ULTIMATE.start_main_~y2~0.offset_9) (<= (+ v_ULTIMATE.start_main_~y2~0.offset_9 4) (select |v_#length_35| v_ULTIMATE.start_main_~y2~0.base_11)) (= 1 (select |v_#valid_40| v_ULTIMATE.start_main_~y2~0.base_11)) (= (store |v_#memory_int_23| v_ULTIMATE.start_main_~y2~0.base_11 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~y2~0.base_11) v_ULTIMATE.start_main_~y2~0.offset_9 |v_ULTIMATE.start_main_#t~nondet12_5|)) |v_#memory_int_22|)) InVars {ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_5|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_11, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_23|, #length=|v_#length_35|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_9} OutVars{ULTIMATE.start_main_#t~nondet12=|v_ULTIMATE.start_main_#t~nondet12_4|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_11, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_22|, #length=|v_#length_35|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12, #memory_int] 206#L33 [141] L33-->L33-1: Formula: (and (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~y1~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem13_2| (select (select |v_#memory_int_5| v_ULTIMATE.start_main_~y1~0.base_7) v_ULTIMATE.start_main_~y1~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~y1~0.offset_6) (<= (+ v_ULTIMATE.start_main_~y1~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~y1~0.base_7))) InVars {ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_7, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_6, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_6, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_2|, #valid=|v_#valid_10|, ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_7, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13] 207#L33-1 [209] L33-1-->L33-2: Formula: (and (<= 0 |v_ULTIMATE.start_main_#t~mem13_3|) |v_ULTIMATE.start_main_#t~short15_2|) InVars {ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|} OutVars{ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_3|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short15] 203#L33-2 [131] L33-2-->L33-3: Formula: |v_ULTIMATE.start_main_#t~short15_3| InVars {ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_3|} OutVars{ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_3|} AuxVars[] AssignedVars[] 198#L33-3 [100] L33-3-->L33-4: Formula: (and (<= 0 v_ULTIMATE.start_main_~y2~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem14_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~y2~0.base_7) v_ULTIMATE.start_main_~y2~0.offset_6)) (= (select |v_#valid_12| v_ULTIMATE.start_main_~y2~0.base_7) 1) (<= (+ v_ULTIMATE.start_main_~y2~0.offset_6 4) (select |v_#length_10| v_ULTIMATE.start_main_~y2~0.base_7))) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_6, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_7, #valid=|v_#valid_12|} OutVars{ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_7, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_6, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 196#L33-4 [216] L33-4-->L33-6: Formula: (and |v_ULTIMATE.start_main_#t~short15_4| (<= 0 |v_ULTIMATE.start_main_#t~mem14_3|)) InVars {ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|} OutVars{ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_3|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short15] 191#L33-6 [93] L33-6-->L19-4: Formula: (and |v_ULTIMATE.start_main_#t~short15_7| (= |v_ULTIMATE.start_gcd_#in~y1.base_1| v_ULTIMATE.start_main_~y1~0.base_10) (= |v_ULTIMATE.start_gcd_#in~y1.offset_1| v_ULTIMATE.start_main_~y1~0.offset_8) (= v_ULTIMATE.start_gcd_~y1.offset_1 |v_ULTIMATE.start_gcd_#in~y1.offset_1|) (= v_ULTIMATE.start_gcd_~y2.offset_1 |v_ULTIMATE.start_gcd_#in~y2.offset_1|) (= v_ULTIMATE.start_gcd_~y2.base_1 |v_ULTIMATE.start_gcd_#in~y2.base_1|) (= |v_ULTIMATE.start_gcd_#in~y2.offset_1| v_ULTIMATE.start_main_~y2~0.offset_8) (= v_ULTIMATE.start_gcd_~y1.base_1 |v_ULTIMATE.start_gcd_#in~y1.base_1|) (= |v_ULTIMATE.start_gcd_#in~y2.base_1| v_ULTIMATE.start_main_~y2~0.base_10)) InVars {ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_10, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_8, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_8, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_10, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_7|} OutVars{ULTIMATE.start_main_~y1~0.base=v_ULTIMATE.start_main_~y1~0.base_10, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_1, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_1, ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_1|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_1|, ULTIMATE.start_main_~y1~0.offset=v_ULTIMATE.start_main_~y1~0.offset_8, ULTIMATE.start_gcd_#t~mem7=|v_ULTIMATE.start_gcd_#t~mem7_1|, ULTIMATE.start_gcd_#t~mem6=|v_ULTIMATE.start_gcd_#t~mem6_1|, ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_1|, ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_1|, ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_1|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_1|, ULTIMATE.start_main_#t~short15=|v_ULTIMATE.start_main_#t~short15_6|, ULTIMATE.start_gcd_#in~y2.offset=|v_ULTIMATE.start_gcd_#in~y2.offset_1|, ULTIMATE.start_gcd_#t~mem8=|v_ULTIMATE.start_gcd_#t~mem8_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_4|, ULTIMATE.start_gcd_#in~y1.base=|v_ULTIMATE.start_gcd_#in~y1.base_1|, ULTIMATE.start_main_#t~mem13=|v_ULTIMATE.start_main_#t~mem13_4|, ULTIMATE.start_gcd_#in~y1.offset=|v_ULTIMATE.start_gcd_#in~y1.offset_1|, ULTIMATE.start_gcd_#in~y2.base=|v_ULTIMATE.start_gcd_#in~y2.base_1|, ULTIMATE.start_main_~y2~0.base=v_ULTIMATE.start_main_~y2~0.base_10, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_1, ULTIMATE.start_gcd_#res=|v_ULTIMATE.start_gcd_#res_1|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_1, ULTIMATE.start_main_~y2~0.offset=v_ULTIMATE.start_main_~y2~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#in~y1.base, ULTIMATE.start_main_#t~mem13, ULTIMATE.start_gcd_#in~y1.offset, ULTIMATE.start_gcd_#in~y2.base, ULTIMATE.start_gcd_~y2.base, ULTIMATE.start_gcd_~y1.base, ULTIMATE.start_gcd_~y1.offset, ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4, ULTIMATE.start_gcd_#t~mem7, ULTIMATE.start_gcd_#t~mem6, ULTIMATE.start_gcd_#t~mem1, ULTIMATE.start_gcd_#t~mem0, ULTIMATE.start_gcd_#res, ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_~y2.offset, ULTIMATE.start_gcd_#t~mem2, ULTIMATE.start_main_#t~short15, ULTIMATE.start_gcd_#in~y2.offset, ULTIMATE.start_gcd_#t~mem8, ULTIMATE.start_main_#t~mem14] 186#L19-4 [2020-06-22 08:59:45,420 INFO L796 eck$LassoCheckResult]: Loop: 186#L19-4 [120] L19-4-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y1.offset_3) (= 1 (select |v_#valid_14| v_ULTIMATE.start_gcd_~y1.base_3)) (= |v_ULTIMATE.start_gcd_#t~mem0_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_gcd_~y1.base_3) v_ULTIMATE.start_gcd_~y1.offset_3)) (<= (+ v_ULTIMATE.start_gcd_~y1.offset_3 4) (select |v_#length_12| v_ULTIMATE.start_gcd_~y1.base_3))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_3, #length=|v_#length_12|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_3, #valid=|v_#valid_14|} OutVars{ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_2|, #valid=|v_#valid_14|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_3, #length=|v_#length_12|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem0] 187#L18-1 [95] L18-1-->L18-2: Formula: (and (= (select |v_#valid_16| v_ULTIMATE.start_gcd_~y2.base_3) 1) (<= (+ v_ULTIMATE.start_gcd_~y2.offset_3 4) (select |v_#length_14| v_ULTIMATE.start_gcd_~y2.base_3)) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_3) (= |v_ULTIMATE.start_gcd_#t~mem1_2| (select (select |v_#memory_int_8| v_ULTIMATE.start_gcd_~y2.base_3) v_ULTIMATE.start_gcd_~y2.offset_3))) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_3, #length=|v_#length_14|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_3, #valid=|v_#valid_16|} OutVars{ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_2|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_3, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_3, #length=|v_#length_14|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem1] 188#L18-2 [229] L18-2-->L19: Formula: (< |v_ULTIMATE.start_gcd_#t~mem1_6| |v_ULTIMATE.start_gcd_#t~mem0_6|) InVars {ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_6|, ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_6|} OutVars{ULTIMATE.start_gcd_#t~mem1=|v_ULTIMATE.start_gcd_#t~mem1_5|, ULTIMATE.start_gcd_#t~mem0=|v_ULTIMATE.start_gcd_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem1, ULTIMATE.start_gcd_#t~mem0] 189#L19 [128] L19-->L19-1: Formula: (and (<= (+ v_ULTIMATE.start_gcd_~y1.offset_5 4) (select |v_#length_16| v_ULTIMATE.start_gcd_~y1.base_6)) (= |v_ULTIMATE.start_gcd_#t~mem2_2| (select (select |v_#memory_int_9| v_ULTIMATE.start_gcd_~y1.base_6) v_ULTIMATE.start_gcd_~y1.offset_5)) (<= 0 v_ULTIMATE.start_gcd_~y1.offset_5) (= (select |v_#valid_18| v_ULTIMATE.start_gcd_~y1.base_6) 1)) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_6, #length=|v_#length_16|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_5, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_2|, #valid=|v_#valid_18|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_6, #length=|v_#length_16|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem2] 194#L19-1 [125] L19-1-->L19-2: Formula: (and (= |v_ULTIMATE.start_gcd_#t~mem3_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_gcd_~y2.base_6) v_ULTIMATE.start_gcd_~y2.offset_5)) (<= 0 v_ULTIMATE.start_gcd_~y2.offset_5) (= 1 (select |v_#valid_20| v_ULTIMATE.start_gcd_~y2.base_6)) (<= (+ v_ULTIMATE.start_gcd_~y2.offset_5 4) (select |v_#length_18| v_ULTIMATE.start_gcd_~y2.base_6))) InVars {#memory_int=|v_#memory_int_10|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_6, #length=|v_#length_18|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_5, #valid=|v_#valid_20|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_2|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_5, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_6, #length=|v_#length_18|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3] 192#L19-2 [123] L19-2-->L20: Formula: (< |v_ULTIMATE.start_gcd_#t~mem3_4| |v_ULTIMATE.start_gcd_#t~mem2_4|) InVars {ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_4|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_4|} OutVars{ULTIMATE.start_gcd_#t~mem3=|v_ULTIMATE.start_gcd_#t~mem3_3|, ULTIMATE.start_gcd_#t~mem2=|v_ULTIMATE.start_gcd_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem3, ULTIMATE.start_gcd_#t~mem2] 193#L20 [152] L20-->L20-1: Formula: (and (= |v_ULTIMATE.start_gcd_#t~mem4_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_gcd_~y1.base_9) v_ULTIMATE.start_gcd_~y1.offset_7)) (<= (+ v_ULTIMATE.start_gcd_~y1.offset_7 4) (select |v_#length_20| v_ULTIMATE.start_gcd_~y1.base_9)) (<= 0 v_ULTIMATE.start_gcd_~y1.offset_7) (= (select |v_#valid_22| v_ULTIMATE.start_gcd_~y1.base_9) 1)) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_9, #length=|v_#length_20|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_7, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_2|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_9, #length=|v_#length_20|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem4] 197#L20-1 [148] L20-1-->L20-2: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y2.offset_7) (= |v_ULTIMATE.start_gcd_#t~mem5_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_gcd_~y2.base_9) v_ULTIMATE.start_gcd_~y2.offset_7)) (<= (+ v_ULTIMATE.start_gcd_~y2.offset_7 4) (select |v_#length_22| v_ULTIMATE.start_gcd_~y2.base_9)) (= 1 (select |v_#valid_24| v_ULTIMATE.start_gcd_~y2.base_9))) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_9, #length=|v_#length_22|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_7, #valid=|v_#valid_24|} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_2|, ULTIMATE.start_gcd_~y2.offset=v_ULTIMATE.start_gcd_~y2.offset_7, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start_gcd_~y2.base=v_ULTIMATE.start_gcd_~y2.base_9, #length=|v_#length_22|} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5] 195#L20-2 [269] L20-2-->L19-4: Formula: (and (<= 0 v_ULTIMATE.start_gcd_~y1.offset_17) (<= (+ v_ULTIMATE.start_gcd_~y1.offset_17 4) (select |v_#length_38| v_ULTIMATE.start_gcd_~y1.base_23)) (= 1 (select |v_#valid_47| v_ULTIMATE.start_gcd_~y1.base_23)) (= (store |v_#memory_int_27| v_ULTIMATE.start_gcd_~y1.base_23 (store (select |v_#memory_int_27| v_ULTIMATE.start_gcd_~y1.base_23) v_ULTIMATE.start_gcd_~y1.offset_17 (+ (* (- 1) |v_ULTIMATE.start_gcd_#t~mem5_6|) |v_ULTIMATE.start_gcd_#t~mem4_6|))) |v_#memory_int_26|)) InVars {ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_6|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_6|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_23, #length=|v_#length_38|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_17} OutVars{ULTIMATE.start_gcd_#t~mem5=|v_ULTIMATE.start_gcd_#t~mem5_5|, ULTIMATE.start_gcd_#t~mem4=|v_ULTIMATE.start_gcd_#t~mem4_5|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_gcd_~y1.base=v_ULTIMATE.start_gcd_~y1.base_23, #length=|v_#length_38|, ULTIMATE.start_gcd_~y1.offset=v_ULTIMATE.start_gcd_~y1.offset_17} AuxVars[] AssignedVars[ULTIMATE.start_gcd_#t~mem5, ULTIMATE.start_gcd_#t~mem4, #memory_int] 186#L19-4 [2020-06-22 08:59:45,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:59:45,421 INFO L82 PathProgramCache]: Analyzing trace with hash 577346184, now seen corresponding path program 2 times [2020-06-22 08:59:45,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:59:45,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:59:45,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:45,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:59:45,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:59:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:59:45,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:59:45,442 INFO L82 PathProgramCache]: Analyzing trace with hash 879239728, now seen corresponding path program 1 times [2020-06-22 08:59:45,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:59:45,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:59:45,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:45,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 08:59:45,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:59:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:59:45,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 08:59:45,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1192857719, now seen corresponding path program 1 times [2020-06-22 08:59:45,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 08:59:45,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 08:59:45,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:45,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 08:59:45,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 08:59:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:59:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 08:59:45,849 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2020-06-22 08:59:45,977 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-06-22 08:59:46,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 08:59:46 BasicIcfg [2020-06-22 08:59:46,016 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 08:59:46,018 INFO L168 Benchmark]: Toolchain (without parser) took 4172.93 ms. Allocated memory was 649.6 MB in the beginning and 747.1 MB in the end (delta: 97.5 MB). Free memory was 564.2 MB in the beginning and 475.7 MB in the end (delta: 88.5 MB). Peak memory consumption was 186.1 MB. Max. memory is 50.3 GB. [2020-06-22 08:59:46,019 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 08:59:46,019 INFO L168 Benchmark]: CACSL2BoogieTranslator took 311.73 ms. Allocated memory was 649.6 MB in the beginning and 679.5 MB in the end (delta: 29.9 MB). Free memory was 564.2 MB in the beginning and 644.5 MB in the end (delta: -80.3 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. [2020-06-22 08:59:46,020 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.19 ms. Allocated memory is still 679.5 MB. Free memory was 643.4 MB in the beginning and 642.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 08:59:46,020 INFO L168 Benchmark]: Boogie Preprocessor took 24.39 ms. Allocated memory is still 679.5 MB. Free memory was 642.4 MB in the beginning and 640.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 08:59:46,021 INFO L168 Benchmark]: RCFGBuilder took 398.84 ms. Allocated memory is still 679.5 MB. Free memory was 640.2 MB in the beginning and 612.6 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 50.3 GB. [2020-06-22 08:59:46,021 INFO L168 Benchmark]: BlockEncodingV2 took 168.62 ms. Allocated memory is still 679.5 MB. Free memory was 612.6 MB in the beginning and 601.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 08:59:46,022 INFO L168 Benchmark]: TraceAbstraction took 2150.09 ms. Allocated memory was 679.5 MB in the beginning and 747.1 MB in the end (delta: 67.6 MB). Free memory was 600.7 MB in the beginning and 651.7 MB in the end (delta: -51.0 MB). Peak memory consumption was 16.7 MB. Max. memory is 50.3 GB. [2020-06-22 08:59:46,023 INFO L168 Benchmark]: BuchiAutomizer took 1072.89 ms. Allocated memory is still 747.1 MB. Free memory was 651.7 MB in the beginning and 475.7 MB in the end (delta: 176.0 MB). Peak memory consumption was 176.0 MB. Max. memory is 50.3 GB. [2020-06-22 08:59:46,027 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 63 locations, 67 edges - StatisticsResult: Encoded RCFG 53 locations, 91 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 311.73 ms. Allocated memory was 649.6 MB in the beginning and 679.5 MB in the end (delta: 29.9 MB). Free memory was 564.2 MB in the beginning and 644.5 MB in the end (delta: -80.3 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.19 ms. Allocated memory is still 679.5 MB. Free memory was 643.4 MB in the beginning and 642.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.39 ms. Allocated memory is still 679.5 MB. Free memory was 642.4 MB in the beginning and 640.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 398.84 ms. Allocated memory is still 679.5 MB. Free memory was 640.2 MB in the beginning and 612.6 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 168.62 ms. Allocated memory is still 679.5 MB. Free memory was 612.6 MB in the beginning and 601.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 2150.09 ms. Allocated memory was 679.5 MB in the beginning and 747.1 MB in the end (delta: 67.6 MB). Free memory was 600.7 MB in the beginning and 651.7 MB in the end (delta: -51.0 MB). Peak memory consumption was 16.7 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1072.89 ms. Allocated memory is still 747.1 MB. Free memory was 651.7 MB in the beginning and 475.7 MB in the end (delta: 176.0 MB). Peak memory consumption was 176.0 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 25]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 33]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 31]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 22]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 32]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant [2020-06-22 08:59:46,039 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:59:46,040 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:59:46,040 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:59:46,040 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:59:46,041 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:59:46,041 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:59:46,041 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 08:59:46,042 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((1 == \valid[y1] && 1 == \valid[y2]) && 4 == unknown-#length-unknown[y2]) && unknown-#length-unknown[y1] == 4) && 0 == y2) && 4 == unknown-#length-unknown[y1]) && 0 == y1) && \valid[y1] == 1) && 0 == y1) && y2 == 0) && 4 == unknown-#length-unknown[y2]) && 1 == \valid[y2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 30 error locations. SAFE Result, 2.0s OverallTime, 11 OverallIterations, 1 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 89 SDtfs, 618 SDslu, 146 SDs, 0 SdLazy, 792 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 53 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 5 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 3001 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 7 locations. The remainder module has 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 2. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31 SDtfs, 6 SDslu, 123 SDs, 0 SdLazy, 248 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 18]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=6465} State at position 1 is {NULL=0, \result=0, NULL=6465, y2=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5950f115=6464, \result=0, y2=0, y1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@259f91aa=0, y2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5950f115=0, y2=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d025715=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@394c4be5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@243a7ea3=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@9619b96=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@7646dfb1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@549bc85d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@4443751=0, y1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@6dd7c502=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6de46f5=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@62a50066=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@221cb1f6=0, y2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@280e7060=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@21b73979=0, y1=6464, y2=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@5eafc7c5=0, y1=6464, y1=6464, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6de46f5=-1, NULL=0, y1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@1185b993=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 18]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L29] int *y1 = alloca(sizeof(int)); [L30] int *y2 = alloca(sizeof(int)); [L31] *y1 = __VERIFIER_nondet_int() [L32] *y2 = __VERIFIER_nondet_int() [L33] EXPR \read(*y1) [L33] *y1 >= 0 && *y2 >= 0 [L33] EXPR \read(*y2) [L33] *y1 >= 0 && *y2 >= 0 [L33] COND TRUE *y1 >= 0 && *y2 >= 0 Loop: [L18] EXPR \read(*y1) [L18] EXPR \read(*y2) [L18] COND TRUE *y1 != *y2 [L19] EXPR \read(*y1) [L19] EXPR \read(*y2) [L19] COND TRUE *y1 > *y2 [L20] EXPR \read(*y1) [L20] EXPR \read(*y2) [L20] *y1 = *y1 - *y2 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! !SESSION 2020-06-22 08:59:38.468 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 08:59:46.292 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check