./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/count_up_and_down_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_64bc3797-0abb-4a9a-97b6-0718f4c20b16/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_64bc3797-0abb-4a9a-97b6-0718f4c20b16/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_64bc3797-0abb-4a9a-97b6-0718f4c20b16/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_64bc3797-0abb-4a9a-97b6-0718f4c20b16/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/count_up_and_down_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_64bc3797-0abb-4a9a-97b6-0718f4c20b16/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_64bc3797-0abb-4a9a-97b6-0718f4c20b16/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 94f95b6ef0a3c8650bd30cb1958ada590298bd1c .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 12:59:15,412 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 12:59:15,413 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 12:59:15,422 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 12:59:15,422 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 12:59:15,423 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 12:59:15,424 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 12:59:15,427 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 12:59:15,428 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 12:59:15,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 12:59:15,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 12:59:15,429 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 12:59:15,430 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 12:59:15,430 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 12:59:15,431 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 12:59:15,432 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 12:59:15,432 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 12:59:15,433 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 12:59:15,435 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 12:59:15,436 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 12:59:15,436 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 12:59:15,437 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 12:59:15,439 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 12:59:15,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 12:59:15,439 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 12:59:15,440 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 12:59:15,441 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 12:59:15,441 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 12:59:15,442 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 12:59:15,442 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 12:59:15,443 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 12:59:15,443 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 12:59:15,443 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 12:59:15,443 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 12:59:15,444 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 12:59:15,445 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 12:59:15,445 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_64bc3797-0abb-4a9a-97b6-0718f4c20b16/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 12:59:15,456 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 12:59:15,456 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 12:59:15,457 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 12:59:15,457 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 12:59:15,457 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 12:59:15,458 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 12:59:15,458 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 12:59:15,458 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 12:59:15,458 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 12:59:15,458 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 12:59:15,458 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 12:59:15,459 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 12:59:15,459 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 12:59:15,459 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 12:59:15,459 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 12:59:15,459 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 12:59:15,459 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 12:59:15,459 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 12:59:15,460 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 12:59:15,460 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 12:59:15,460 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 12:59:15,460 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 12:59:15,460 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 12:59:15,460 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 12:59:15,461 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 12:59:15,461 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 12:59:15,461 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 12:59:15,462 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 12:59:15,462 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_64bc3797-0abb-4a9a-97b6-0718f4c20b16/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94f95b6ef0a3c8650bd30cb1958ada590298bd1c [2018-11-10 12:59:15,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 12:59:15,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 12:59:15,498 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 12:59:15,500 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 12:59:15,500 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 12:59:15,501 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_64bc3797-0abb-4a9a-97b6-0718f4c20b16/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/count_up_and_down_alloca_true-termination.c.i [2018-11-10 12:59:15,546 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_64bc3797-0abb-4a9a-97b6-0718f4c20b16/bin-2019/uautomizer/data/c4ff82986/9ee852d4f9bf453b9287a5ec806d39bd/FLAG28ebf62d2 [2018-11-10 12:59:15,926 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 12:59:15,927 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_64bc3797-0abb-4a9a-97b6-0718f4c20b16/sv-benchmarks/c/termination-15/count_up_and_down_alloca_true-termination.c.i [2018-11-10 12:59:15,934 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_64bc3797-0abb-4a9a-97b6-0718f4c20b16/bin-2019/uautomizer/data/c4ff82986/9ee852d4f9bf453b9287a5ec806d39bd/FLAG28ebf62d2 [2018-11-10 12:59:15,946 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_64bc3797-0abb-4a9a-97b6-0718f4c20b16/bin-2019/uautomizer/data/c4ff82986/9ee852d4f9bf453b9287a5ec806d39bd [2018-11-10 12:59:15,948 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 12:59:15,949 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 12:59:15,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 12:59:15,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 12:59:15,953 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 12:59:15,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:59:15" (1/1) ... [2018-11-10 12:59:15,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b5db350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:15, skipping insertion in model container [2018-11-10 12:59:15,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:59:15" (1/1) ... [2018-11-10 12:59:15,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 12:59:15,990 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 12:59:16,185 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:59:16,192 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 12:59:16,220 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 12:59:16,262 INFO L193 MainTranslator]: Completed translation [2018-11-10 12:59:16,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:16 WrapperNode [2018-11-10 12:59:16,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 12:59:16,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 12:59:16,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 12:59:16,264 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 12:59:16,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:16" (1/1) ... [2018-11-10 12:59:16,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:16" (1/1) ... [2018-11-10 12:59:16,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 12:59:16,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 12:59:16,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 12:59:16,339 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 12:59:16,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:16" (1/1) ... [2018-11-10 12:59:16,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:16" (1/1) ... [2018-11-10 12:59:16,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:16" (1/1) ... [2018-11-10 12:59:16,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:16" (1/1) ... [2018-11-10 12:59:16,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:16" (1/1) ... [2018-11-10 12:59:16,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:16" (1/1) ... [2018-11-10 12:59:16,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:16" (1/1) ... [2018-11-10 12:59:16,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 12:59:16,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 12:59:16,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 12:59:16,357 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 12:59:16,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64bc3797-0abb-4a9a-97b6-0718f4c20b16/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:59:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 12:59:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 12:59:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 12:59:16,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 12:59:16,539 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 12:59:16,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:59:16 BoogieIcfgContainer [2018-11-10 12:59:16,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 12:59:16,540 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 12:59:16,540 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 12:59:16,542 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 12:59:16,543 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:59:16,543 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 12:59:15" (1/3) ... [2018-11-10 12:59:16,544 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b0d4764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:59:16, skipping insertion in model container [2018-11-10 12:59:16,544 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:59:16,544 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:59:16" (2/3) ... [2018-11-10 12:59:16,545 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5b0d4764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 12:59:16, skipping insertion in model container [2018-11-10 12:59:16,545 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 12:59:16,545 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:59:16" (3/3) ... [2018-11-10 12:59:16,546 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_up_and_down_alloca_true-termination.c.i [2018-11-10 12:59:16,586 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 12:59:16,586 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 12:59:16,587 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 12:59:16,587 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 12:59:16,587 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 12:59:16,587 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 12:59:16,587 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 12:59:16,587 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 12:59:16,587 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 12:59:16,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 12:59:16,611 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-10 12:59:16,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:59:16,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:59:16,616 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:59:16,616 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 12:59:16,616 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 12:59:16,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-10 12:59:16,617 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2018-11-10 12:59:16,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:59:16,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:59:16,618 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:59:16,618 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 12:59:16,623 INFO L793 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 17#L367true assume !(main_~length~0 < 1); 5#L367-2true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 14#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0); 25#L370true SUMMARY for call write~int(0, main_~arr~0.base, main_~arr~0.offset + 0, 4); srcloc: L370 28#L370-1true main_~i~0 := 1; 18#L371-4true [2018-11-10 12:59:16,624 INFO L795 eck$LassoCheckResult]: Loop: 18#L371-4true assume true; 12#L371-1true assume !!(main_~i~0 < main_~length~0); 21#L372true SUMMARY for call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + (main_~i~0 - 1) * 4, 4); srcloc: L372 23#L372-1true SUMMARY for call write~int(main_#t~mem208 + 1, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L372-1 27#L372-2true havoc main_#t~mem208; 16#L371-3true main_#t~post207 := main_~i~0;main_~i~0 := main_#t~post207 + 1;havoc main_#t~post207; 18#L371-4true [2018-11-10 12:59:16,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:16,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815338, now seen corresponding path program 1 times [2018-11-10 12:59:16,628 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:16,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:16,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:16,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:16,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:16,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:16,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1483976137, now seen corresponding path program 1 times [2018-11-10 12:59:16,713 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:16,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:16,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:16,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:16,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:16,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:16,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1039649650, now seen corresponding path program 1 times [2018-11-10 12:59:16,727 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:16,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:16,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:16,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:16,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:16,974 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:59:16,975 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:59:16,975 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:59:16,976 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:59:16,976 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:59:16,976 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:59:16,976 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:59:16,976 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:59:16,976 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-10 12:59:16,976 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:59:16,977 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:59:16,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:16,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:17,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:17,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:17,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:17,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:17,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:17,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:17,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:17,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:17,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:17,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:17,361 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:59:17,364 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:59:17,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:17,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:17,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:59:17,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:17,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:17,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:17,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:59:17,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:59:17,371 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:17,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:17,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:17,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:17,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:17,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:17,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:59:17,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:59:17,383 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:17,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:17,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:17,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:17,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:17,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:17,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:59:17,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:59:17,428 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:59:17,444 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:59:17,445 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:59:17,447 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:59:17,448 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:59:17,449 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:59:17,449 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1, ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~arr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 4*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-10 12:59:17,470 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-10 12:59:17,475 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 12:59:17,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:17,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:59:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:17,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:59:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:17,546 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 12:59:17,547 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states. Second operand 4 states. [2018-11-10 12:59:17,602 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states.. Second operand 4 states. Result 67 states and 80 transitions. Complement of second has 7 states. [2018-11-10 12:59:17,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:59:17,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:59:17,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-10 12:59:17,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-10 12:59:17,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:59:17,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-10 12:59:17,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:59:17,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 55 transitions. Stem has 7 letters. Loop has 12 letters. [2018-11-10 12:59:17,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:59:17,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 80 transitions. [2018-11-10 12:59:17,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 12:59:17,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 26 states and 30 transitions. [2018-11-10 12:59:17,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 12:59:17,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-10 12:59:17,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2018-11-10 12:59:17,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:59:17,613 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-10 12:59:17,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2018-11-10 12:59:17,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-10 12:59:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-10 12:59:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-10 12:59:17,632 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-10 12:59:17,632 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-10 12:59:17,632 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 12:59:17,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 30 transitions. [2018-11-10 12:59:17,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-10 12:59:17,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:59:17,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:59:17,633 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:59:17,633 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 12:59:17,633 INFO L793 eck$LassoCheckResult]: Stem: 195#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 191#L367 assume !(main_~length~0 < 1); 181#L367-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 182#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0); 197#L370 SUMMARY for call write~int(0, main_~arr~0.base, main_~arr~0.offset + 0, 4); srcloc: L370 198#L370-1 main_~i~0 := 1; 201#L371-4 assume true; 199#L371-1 assume !(main_~i~0 < main_~length~0); 177#L371-5 main_~j~0 := 0; 178#L374-4 [2018-11-10 12:59:17,634 INFO L795 eck$LassoCheckResult]: Loop: 178#L374-4 assume true; 187#L374-1 assume !!(main_~j~0 < main_~length~0); 188#L375-4 assume true; 184#L375-1 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L375-1 185#L375-2 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 189#L374-3 main_#t~post209 := main_~j~0;main_~j~0 := main_#t~post209 + 1;havoc main_#t~post209; 178#L374-4 [2018-11-10 12:59:17,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:17,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1989366443, now seen corresponding path program 1 times [2018-11-10 12:59:17,634 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:17,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:17,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:17,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:17,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:17,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:17,648 INFO L82 PathProgramCache]: Analyzing trace with hash 2016571762, now seen corresponding path program 1 times [2018-11-10 12:59:17,648 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:17,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:17,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:17,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:17,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:17,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:17,656 INFO L82 PathProgramCache]: Analyzing trace with hash 842321862, now seen corresponding path program 1 times [2018-11-10 12:59:17,656 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:17,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:17,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:17,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:17,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:17,803 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:59:17,804 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:59:17,804 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:59:17,804 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:59:17,804 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:59:17,804 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:59:17,804 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:59:17,804 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:59:17,804 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-10 12:59:17,805 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:59:17,805 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:59:17,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:17,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:17,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:17,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:17,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:17,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:17,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:17,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:17,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:17,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:17,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:18,113 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:59:18,113 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:59:18,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:18,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:18,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:59:18,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:18,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:18,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:18,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:59:18,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:59:18,116 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:18,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:18,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:18,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:59:18,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:18,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:18,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:18,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:59:18,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:59:18,118 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:18,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:18,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:18,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:59:18,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:18,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:18,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:18,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:59:18,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:59:18,121 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:18,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:18,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:18,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:59:18,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:18,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:18,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:18,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:59:18,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:59:18,125 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:18,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:18,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:18,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:18,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:18,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:18,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:59:18,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:59:18,130 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:18,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:18,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:18,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:18,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:18,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:18,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:59:18,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:59:18,134 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:18,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:18,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:18,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:18,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:18,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:18,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:59:18,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:59:18,139 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:18,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:18,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:18,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:18,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:18,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:18,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:59:18,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:59:18,143 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:18,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:18,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:18,143 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:59:18,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:18,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:18,145 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:59:18,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:59:18,150 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:18,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:18,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:18,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:18,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:18,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:18,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:59:18,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:59:18,156 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:18,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:18,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:18,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:18,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:18,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:18,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:59:18,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:59:18,164 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:18,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:18,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:18,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:18,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:18,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:18,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:59:18,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:59:18,190 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:59:18,204 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 12:59:18,204 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 12:59:18,204 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:59:18,205 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 12:59:18,205 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:59:18,206 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-11-10 12:59:18,224 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 12:59:18,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:18,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:59:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:18,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:59:18,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:18,262 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 12:59:18,262 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 6 Second operand 4 states. [2018-11-10 12:59:18,280 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 36 states and 42 transitions. Complement of second has 6 states. [2018-11-10 12:59:18,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:59:18,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 12:59:18,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-10 12:59:18,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-10 12:59:18,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:59:18,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 16 letters. Loop has 6 letters. [2018-11-10 12:59:18,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:59:18,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 10 letters. Loop has 12 letters. [2018-11-10 12:59:18,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:59:18,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 42 transitions. [2018-11-10 12:59:18,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:59:18,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 41 transitions. [2018-11-10 12:59:18,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-10 12:59:18,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 12:59:18,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 41 transitions. [2018-11-10 12:59:18,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:59:18,285 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-10 12:59:18,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 41 transitions. [2018-11-10 12:59:18,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-10 12:59:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 12:59:18,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-10 12:59:18,287 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-10 12:59:18,288 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-10 12:59:18,288 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 12:59:18,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 41 transitions. [2018-11-10 12:59:18,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:59:18,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:59:18,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:59:18,289 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:59:18,289 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:59:18,289 INFO L793 eck$LassoCheckResult]: Stem: 347#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 343#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 344#L367 assume !(main_~length~0 < 1); 328#L367-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 329#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0); 350#L370 SUMMARY for call write~int(0, main_~arr~0.base, main_~arr~0.offset + 0, 4); srcloc: L370 351#L370-1 main_~i~0 := 1; 355#L371-4 assume true; 352#L371-1 assume !(main_~i~0 < main_~length~0); 322#L371-5 main_~j~0 := 0; 323#L374-4 assume true; 340#L374-1 assume !!(main_~j~0 < main_~length~0); 338#L375-4 [2018-11-10 12:59:18,289 INFO L795 eck$LassoCheckResult]: Loop: 338#L375-4 assume true; 332#L375-1 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L375-1 333#L375-2 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210; 324#L376 SUMMARY for call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L376 325#L376-1 main_#t~post212 := main_#t~mem211; 330#L376-2 SUMMARY for call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L376-2 336#L376-3 havoc main_#t~mem211;havoc main_#t~post212; 338#L375-4 [2018-11-10 12:59:18,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:18,290 INFO L82 PathProgramCache]: Analyzing trace with hash -520703782, now seen corresponding path program 1 times [2018-11-10 12:59:18,290 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:18,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:18,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:18,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:18,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:18,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:18,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1960203061, now seen corresponding path program 1 times [2018-11-10 12:59:18,300 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:18,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:18,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:18,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:18,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:18,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:18,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1881625540, now seen corresponding path program 1 times [2018-11-10 12:59:18,307 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:18,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:18,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:18,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:18,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:18,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:18,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:18,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 12:59:18,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 12:59:18,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 12:59:18,461 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-10 12:59:18,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:18,520 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-10 12:59:18,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 12:59:18,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 74 transitions. [2018-11-10 12:59:18,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:59:18,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 62 states and 70 transitions. [2018-11-10 12:59:18,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-10 12:59:18,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-10 12:59:18,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 70 transitions. [2018-11-10 12:59:18,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:59:18,523 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-11-10 12:59:18,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 70 transitions. [2018-11-10 12:59:18,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2018-11-10 12:59:18,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-10 12:59:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-10 12:59:18,526 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-10 12:59:18,526 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-10 12:59:18,526 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 12:59:18,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 48 transitions. [2018-11-10 12:59:18,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:59:18,527 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:59:18,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:59:18,527 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:59:18,527 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:59:18,527 INFO L793 eck$LassoCheckResult]: Stem: 466#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 461#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 462#L367 assume !(main_~length~0 < 1); 444#L367-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 445#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0); 471#L370 SUMMARY for call write~int(0, main_~arr~0.base, main_~arr~0.offset + 0, 4); srcloc: L370 472#L370-1 main_~i~0 := 1; 473#L371-4 assume true; 468#L371-1 assume !(main_~i~0 < main_~length~0); 438#L371-5 main_~j~0 := 0; 439#L374-4 assume true; 470#L374-1 assume !!(main_~j~0 < main_~length~0); 479#L375-4 assume true; 450#L375-1 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L375-1 451#L375-2 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 458#L374-3 main_#t~post209 := main_~j~0;main_~j~0 := main_#t~post209 + 1;havoc main_#t~post209; 464#L374-4 assume true; 454#L374-1 assume !!(main_~j~0 < main_~length~0); 455#L375-4 [2018-11-10 12:59:18,528 INFO L795 eck$LassoCheckResult]: Loop: 455#L375-4 assume true; 448#L375-1 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L375-1 449#L375-2 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210; 440#L376 SUMMARY for call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L376 441#L376-1 main_#t~post212 := main_#t~mem211; 446#L376-2 SUMMARY for call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L376-2 452#L376-3 havoc main_#t~mem211;havoc main_#t~post212; 455#L375-4 [2018-11-10 12:59:18,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:18,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2017458955, now seen corresponding path program 2 times [2018-11-10 12:59:18,528 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:18,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:18,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:18,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:18,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:18,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:18,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 12:59:18,567 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_64bc3797-0abb-4a9a-97b6-0718f4c20b16/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 12:59:18,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 12:59:18,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 12:59:18,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 12:59:18,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:59:18,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:18,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 12:59:18,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2018-11-10 12:59:18,678 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 12:59:18,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:18,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1960203061, now seen corresponding path program 2 times [2018-11-10 12:59:18,678 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:18,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:18,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:18,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:59:18,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:18,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:18,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 12:59:18,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-10 12:59:18,743 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. cyclomatic complexity: 9 Second operand 11 states. [2018-11-10 12:59:18,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:18,815 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2018-11-10 12:59:18,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 12:59:18,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 63 transitions. [2018-11-10 12:59:18,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:59:18,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 40 states and 44 transitions. [2018-11-10 12:59:18,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-10 12:59:18,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 12:59:18,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 44 transitions. [2018-11-10 12:59:18,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:59:18,818 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-11-10 12:59:18,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 44 transitions. [2018-11-10 12:59:18,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-11-10 12:59:18,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 12:59:18,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-10 12:59:18,820 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-10 12:59:18,820 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-10 12:59:18,820 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 12:59:18,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 39 transitions. [2018-11-10 12:59:18,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:59:18,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:59:18,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:59:18,822 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:59:18,822 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:59:18,822 INFO L793 eck$LassoCheckResult]: Stem: 636#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 632#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 633#L367 assume !(main_~length~0 < 1); 615#L367-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 616#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0); 640#L370 SUMMARY for call write~int(0, main_~arr~0.base, main_~arr~0.offset + 0, 4); srcloc: L370 641#L370-1 main_~i~0 := 1; 642#L371-4 assume true; 638#L371-1 assume !!(main_~i~0 < main_~length~0); 630#L372 SUMMARY for call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + (main_~i~0 - 1) * 4, 4); srcloc: L372 631#L372-1 SUMMARY for call write~int(main_#t~mem208 + 1, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L372-1 634#L372-2 havoc main_#t~mem208; 639#L371-3 main_#t~post207 := main_~i~0;main_~i~0 := main_#t~post207 + 1;havoc main_#t~post207; 643#L371-4 assume true; 637#L371-1 assume !(main_~i~0 < main_~length~0); 609#L371-5 main_~j~0 := 0; 610#L374-4 assume true; 625#L374-1 assume !!(main_~j~0 < main_~length~0); 626#L375-4 [2018-11-10 12:59:18,822 INFO L795 eck$LassoCheckResult]: Loop: 626#L375-4 assume true; 619#L375-1 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L375-1 620#L375-2 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210; 611#L376 SUMMARY for call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L376 612#L376-1 main_#t~post212 := main_#t~mem211; 617#L376-2 SUMMARY for call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L376-2 623#L376-3 havoc main_#t~mem211;havoc main_#t~post212; 626#L375-4 [2018-11-10 12:59:18,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:18,822 INFO L82 PathProgramCache]: Analyzing trace with hash 266099410, now seen corresponding path program 1 times [2018-11-10 12:59:18,822 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:18,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:18,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:18,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:59:18,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:18,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:18,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1960203061, now seen corresponding path program 3 times [2018-11-10 12:59:18,836 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:18,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:18,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:18,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:18,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:18,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:18,841 INFO L82 PathProgramCache]: Analyzing trace with hash 236346180, now seen corresponding path program 1 times [2018-11-10 12:59:18,841 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:18,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:18,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:18,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:59:18,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:18,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:18,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 12:59:18,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 12:59:19,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 12:59:19,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-11-10 12:59:19,016 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. cyclomatic complexity: 7 Second operand 8 states. [2018-11-10 12:59:19,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 12:59:19,064 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-11-10 12:59:19,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 12:59:19,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 67 transitions. [2018-11-10 12:59:19,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:59:19,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 58 states and 63 transitions. [2018-11-10 12:59:19,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-10 12:59:19,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-10 12:59:19,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 63 transitions. [2018-11-10 12:59:19,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 12:59:19,066 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-11-10 12:59:19,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 63 transitions. [2018-11-10 12:59:19,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2018-11-10 12:59:19,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-10 12:59:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-11-10 12:59:19,068 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-10 12:59:19,071 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-11-10 12:59:19,071 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 12:59:19,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 42 transitions. [2018-11-10 12:59:19,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 12:59:19,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 12:59:19,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 12:59:19,072 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:59:19,072 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 12:59:19,073 INFO L793 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 740#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~mem208, main_#t~post207, main_#t~mem211, main_#t~post212, main_#t~mem210, main_#t~post209, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 741#L367 assume !(main_~length~0 < 1); 725#L367-2 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 726#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0); 748#L370 SUMMARY for call write~int(0, main_~arr~0.base, main_~arr~0.offset + 0, 4); srcloc: L370 749#L370-1 main_~i~0 := 1; 754#L371-4 assume true; 751#L371-1 assume !!(main_~i~0 < main_~length~0); 742#L372 SUMMARY for call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + (main_~i~0 - 1) * 4, 4); srcloc: L372 743#L372-1 SUMMARY for call write~int(main_#t~mem208 + 1, main_~arr~0.base, main_~arr~0.offset + main_~i~0 * 4, 4); srcloc: L372-1 745#L372-2 havoc main_#t~mem208; 752#L371-3 main_#t~post207 := main_~i~0;main_~i~0 := main_#t~post207 + 1;havoc main_#t~post207; 755#L371-4 assume true; 750#L371-1 assume !(main_~i~0 < main_~length~0); 719#L371-5 main_~j~0 := 0; 720#L374-4 assume true; 753#L374-1 assume !!(main_~j~0 < main_~length~0); 746#L375-4 assume true; 731#L375-1 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L375-1 732#L375-2 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 739#L374-3 main_#t~post209 := main_~j~0;main_~j~0 := main_#t~post209 + 1;havoc main_#t~post209; 747#L374-4 assume true; 735#L374-1 assume !!(main_~j~0 < main_~length~0); 736#L375-4 [2018-11-10 12:59:19,073 INFO L795 eck$LassoCheckResult]: Loop: 736#L375-4 assume true; 729#L375-1 SUMMARY for call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L375-1 730#L375-2 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210; 721#L376 SUMMARY for call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L376 722#L376-1 main_#t~post212 := main_#t~mem211; 727#L376-2 SUMMARY for call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + main_~j~0 * 4, 4); srcloc: L376-2 733#L376-3 havoc main_#t~mem211;havoc main_#t~post212; 736#L375-4 [2018-11-10 12:59:19,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:19,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1670138627, now seen corresponding path program 1 times [2018-11-10 12:59:19,073 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:19,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:19,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:19,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:19,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:19,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:19,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1960203061, now seen corresponding path program 4 times [2018-11-10 12:59:19,087 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:19,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:19,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:19,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 12:59:19,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:19,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:19,093 INFO L82 PathProgramCache]: Analyzing trace with hash 61997555, now seen corresponding path program 1 times [2018-11-10 12:59:19,093 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 12:59:19,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 12:59:19,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:19,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 12:59:19,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 12:59:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 12:59:19,280 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 82 [2018-11-10 12:59:19,317 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 12:59:19,317 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 12:59:19,317 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 12:59:19,317 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 12:59:19,317 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 12:59:19,317 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 12:59:19,317 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 12:59:19,317 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 12:59:19,318 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca_true-termination.c.i_Iteration6_Lasso [2018-11-10 12:59:19,318 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 12:59:19,318 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 12:59:19,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:19,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:19,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:19,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:19,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:19,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:19,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:19,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:19,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:19,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:19,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:19,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 12:59:19,556 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 12:59:19,556 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 12:59:19,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:19,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:19,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:59:19,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:19,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:19,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:19,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:59:19,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:59:19,559 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:19,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:19,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:19,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:59:19,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:19,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:19,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:19,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:59:19,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:59:19,560 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:19,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:19,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:19,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:19,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:19,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:19,561 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:59:19,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:59:19,563 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:19,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:19,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:19,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:59:19,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:19,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:19,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:19,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:59:19,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:59:19,564 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:19,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:19,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:19,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:59:19,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:19,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:19,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:19,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:59:19,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:59:19,566 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:19,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:19,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:19,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:19,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:19,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:19,568 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:59:19,568 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:59:19,569 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:19,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:19,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:19,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:59:19,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:19,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:19,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:19,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:59:19,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:59:19,571 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:19,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:19,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:19,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:59:19,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:19,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:19,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:19,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:59:19,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:59:19,572 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:19,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:19,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:19,573 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 12:59:19,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:19,573 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:19,577 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 12:59:19,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:59:19,581 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:19,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:19,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:19,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:19,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:19,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:19,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:59:19,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:59:19,584 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:19,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:19,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:19,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:19,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:19,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:19,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:59:19,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:59:19,592 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:19,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:19,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:19,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:19,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:19,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:19,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 12:59:19,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 12:59:19,596 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 12:59:19,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 12:59:19,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 12:59:19,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 12:59:19,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 12:59:19,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 12:59:19,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 12:59:19,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 12:59:19,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 12:59:19,603 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 12:59:19,604 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 12:59:19,604 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 12:59:19,604 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 12:59:19,604 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 12:59:19,604 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 12:59:19,604 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~arr~0.offset))_2 Supporting invariants [] [2018-11-10 12:59:19,629 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 12:59:19,630 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 12:59:19,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:19,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:59:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:19,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:59:19,704 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:59:19,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-10 12:59:19,713 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:59:19,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2018-11-10 12:59:19,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:59:19,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:59:19,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:59:19,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 12:59:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:19,739 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 12:59:19,740 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 6 Second operand 8 states. [2018-11-10 12:59:19,750 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 6. Second operand 8 states. Result 43 states and 46 transitions. Complement of second has 7 states. [2018-11-10 12:59:19,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:59:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:59:19,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-10 12:59:19,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 24 letters. Loop has 7 letters. [2018-11-10 12:59:19,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:59:19,752 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:59:19,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:19,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:59:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:19,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:59:19,826 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:59:19,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-10 12:59:19,829 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:59:19,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2018-11-10 12:59:19,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:59:19,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:59:19,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:59:19,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 12:59:19,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:19,852 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 12:59:19,853 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 6 Second operand 8 states. [2018-11-10 12:59:19,863 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 6. Second operand 8 states. Result 43 states and 46 transitions. Complement of second has 7 states. [2018-11-10 12:59:19,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 12:59:19,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:59:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-10 12:59:19,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 24 letters. Loop has 7 letters. [2018-11-10 12:59:19,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:59:19,864 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 12:59:19,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 12:59:19,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:19,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:59:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 12:59:19,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 12:59:19,931 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 12:59:19,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-10 12:59:19,935 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 12:59:19,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 40 [2018-11-10 12:59:19,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 12:59:19,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:59:19,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 12:59:19,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:17 [2018-11-10 12:59:19,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 12:59:19,977 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 12:59:19,977 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 6 Second operand 8 states. [2018-11-10 12:59:20,019 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 6. Second operand 8 states. Result 57 states and 63 transitions. Complement of second has 12 states. [2018-11-10 12:59:20,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 12:59:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 12:59:20,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2018-11-10 12:59:20,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 24 letters. Loop has 7 letters. [2018-11-10 12:59:20,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:59:20,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 31 letters. Loop has 7 letters. [2018-11-10 12:59:20,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:59:20,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 24 letters. Loop has 14 letters. [2018-11-10 12:59:20,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 12:59:20,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 63 transitions. [2018-11-10 12:59:20,023 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:59:20,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 0 states and 0 transitions. [2018-11-10 12:59:20,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 12:59:20,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 12:59:20,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 12:59:20,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 12:59:20,024 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:59:20,024 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:59:20,024 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 12:59:20,024 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 12:59:20,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 12:59:20,024 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 12:59:20,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 12:59:20,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 12:59:20 BoogieIcfgContainer [2018-11-10 12:59:20,031 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 12:59:20,032 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:59:20,032 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:59:20,032 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:59:20,032 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:59:16" (3/4) ... [2018-11-10 12:59:20,035 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 12:59:20,035 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:59:20,036 INFO L168 Benchmark]: Toolchain (without parser) took 4087.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.6 MB). Free memory was 950.0 MB in the beginning and 1.3 GB in the end (delta: -347.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:59:20,037 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:59:20,037 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.35 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 923.2 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-10 12:59:20,037 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 923.2 MB in the beginning and 1.2 GB in the end (delta: -235.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:59:20,038 INFO L168 Benchmark]: Boogie Preprocessor took 18.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:59:20,038 INFO L168 Benchmark]: RCFGBuilder took 182.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2018-11-10 12:59:20,039 INFO L168 Benchmark]: BuchiAutomizer took 3492.04 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -159.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:59:20,039 INFO L168 Benchmark]: Witness Printer took 3.48 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:59:20,042 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 313.35 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 923.2 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 923.2 MB in the beginning and 1.2 GB in the end (delta: -235.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 182.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3492.04 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 151.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -159.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.48 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * arr + unknown-#length-unknown[arr] + -4 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * j + length and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][4 * j + arr] and consists of 7 locations. 3 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 44 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 42 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 158 SDtfs, 318 SDslu, 179 SDs, 0 SdLazy, 235 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital137 mio100 ax100 hnf99 lsp94 ukn90 mio100 lsp52 div100 bol100 ite100 ukn100 eq165 hnf88 smp88 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 7ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...