./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b3baa01f-4669-4168-ba0d-17ebb45acdf2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b3baa01f-4669-4168-ba0d-17ebb45acdf2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b3baa01f-4669-4168-ba0d-17ebb45acdf2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b3baa01f-4669-4168-ba0d-17ebb45acdf2/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_b3baa01f-4669-4168-ba0d-17ebb45acdf2/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b3baa01f-4669-4168-ba0d-17ebb45acdf2/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-aa41828 [2018-11-22 21:30:13,434 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:30:13,436 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:30:13,445 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:30:13,445 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:30:13,445 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:30:13,446 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:30:13,448 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:30:13,449 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:30:13,450 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:30:13,450 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:30:13,451 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:30:13,451 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:30:13,452 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:30:13,453 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:30:13,454 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:30:13,454 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:30:13,456 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:30:13,457 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:30:13,458 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:30:13,459 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:30:13,460 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:30:13,462 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:30:13,462 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:30:13,462 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:30:13,463 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:30:13,464 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:30:13,464 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:30:13,465 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:30:13,466 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:30:13,466 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:30:13,467 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:30:13,467 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:30:13,467 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:30:13,468 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:30:13,468 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:30:13,468 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b3baa01f-4669-4168-ba0d-17ebb45acdf2/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-22 21:30:13,480 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:30:13,480 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:30:13,481 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:30:13,481 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:30:13,482 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:30:13,482 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 21:30:13,482 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 21:30:13,482 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 21:30:13,482 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 21:30:13,482 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 21:30:13,483 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 21:30:13,483 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:30:13,483 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 21:30:13,483 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:30:13,483 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:30:13,483 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 21:30:13,483 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 21:30:13,484 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 21:30:13,484 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:30:13,484 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 21:30:13,484 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:30:13,484 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 21:30:13,484 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:30:13,485 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:30:13,485 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 21:30:13,485 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:30:13,485 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 21:30:13,485 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 21:30:13,486 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 21:30:13,486 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_b3baa01f-4669-4168-ba0d-17ebb45acdf2/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-22 21:30:13,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:30:13,518 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:30:13,520 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:30:13,521 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:30:13,521 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:30:13,522 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b3baa01f-4669-4168-ba0d-17ebb45acdf2/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/count_up_and_down_alloca_true-termination.c.i [2018-11-22 21:30:13,564 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3baa01f-4669-4168-ba0d-17ebb45acdf2/bin-2019/uautomizer/data/fe41c410f/0e56080a763a4ac2bdc66816417e422f/FLAG9d31ef128 [2018-11-22 21:30:13,911 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:30:13,912 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b3baa01f-4669-4168-ba0d-17ebb45acdf2/sv-benchmarks/c/termination-15/count_up_and_down_alloca_true-termination.c.i [2018-11-22 21:30:13,919 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3baa01f-4669-4168-ba0d-17ebb45acdf2/bin-2019/uautomizer/data/fe41c410f/0e56080a763a4ac2bdc66816417e422f/FLAG9d31ef128 [2018-11-22 21:30:13,931 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b3baa01f-4669-4168-ba0d-17ebb45acdf2/bin-2019/uautomizer/data/fe41c410f/0e56080a763a4ac2bdc66816417e422f [2018-11-22 21:30:13,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:30:13,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:30:13,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:30:13,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:30:13,938 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:30:13,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:30:13" (1/1) ... [2018-11-22 21:30:13,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16755fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:13, skipping insertion in model container [2018-11-22 21:30:13,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:30:13" (1/1) ... [2018-11-22 21:30:13,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:30:13,980 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:30:14,206 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:30:14,215 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:30:14,310 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:30:14,347 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:30:14,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:14 WrapperNode [2018-11-22 21:30:14,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:30:14,347 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:30:14,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:30:14,348 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:30:14,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:14" (1/1) ... [2018-11-22 21:30:14,361 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:14" (1/1) ... [2018-11-22 21:30:14,374 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:30:14,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:30:14,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:30:14,374 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:30:14,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:14" (1/1) ... [2018-11-22 21:30:14,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:14" (1/1) ... [2018-11-22 21:30:14,381 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:14" (1/1) ... [2018-11-22 21:30:14,381 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:14" (1/1) ... [2018-11-22 21:30:14,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:14" (1/1) ... [2018-11-22 21:30:14,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:14" (1/1) ... [2018-11-22 21:30:14,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:14" (1/1) ... [2018-11-22 21:30:14,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:30:14,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:30:14,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:30:14,391 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:30:14,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3baa01f-4669-4168-ba0d-17ebb45acdf2/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-22 21:30:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:30:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 21:30:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 21:30:14,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 21:30:14,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:30:14,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:30:14,560 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:30:14,560 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-22 21:30:14,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:30:14 BoogieIcfgContainer [2018-11-22 21:30:14,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:30:14,561 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 21:30:14,561 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 21:30:14,565 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 21:30:14,565 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:30:14,566 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 09:30:13" (1/3) ... [2018-11-22 21:30:14,566 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26335524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 09:30:14, skipping insertion in model container [2018-11-22 21:30:14,566 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:30:14,567 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:30:14" (2/3) ... [2018-11-22 21:30:14,567 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26335524 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 09:30:14, skipping insertion in model container [2018-11-22 21:30:14,567 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 21:30:14,567 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:30:14" (3/3) ... [2018-11-22 21:30:14,569 INFO L375 chiAutomizerObserver]: Analyzing ICFG count_up_and_down_alloca_true-termination.c.i [2018-11-22 21:30:14,613 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:30:14,614 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 21:30:14,614 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 21:30:14,614 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 21:30:14,614 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:30:14,614 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:30:14,614 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 21:30:14,615 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:30:14,615 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 21:30:14,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-22 21:30:14,647 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-22 21:30:14,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:30:14,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:30:14,653 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 21:30:14,653 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 21:30:14,653 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 21:30:14,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2018-11-22 21:30:14,654 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-22 21:30:14,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:30:14,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:30:14,655 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 21:30:14,655 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 21:30:14,660 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true 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); 3#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 15#L371-3true [2018-11-22 21:30:14,660 INFO L796 eck$LassoCheckResult]: Loop: 15#L371-3true assume !!(main_~i~0 < main_~length~0);call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (main_~i~0 - 1), 4);call write~int(1 + main_#t~mem208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem208; 13#L371-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 15#L371-3true [2018-11-22 21:30:14,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:14,665 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2018-11-22 21:30:14,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:30:14,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:30:14,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:14,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:30:14,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:14,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:14,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1667, now seen corresponding path program 1 times [2018-11-22 21:30:14,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:30:14,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:30:14,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:14,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:30:14,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:14,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:14,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815563, now seen corresponding path program 1 times [2018-11-22 21:30:14,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:30:14,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:30:14,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:14,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:30:14,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:15,005 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:30:15,006 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:30:15,006 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:30:15,006 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:30:15,006 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:30:15,007 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:30:15,007 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:30:15,007 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:30:15,007 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca_true-termination.c.i_Iteration1_Lasso [2018-11-22 21:30:15,007 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:30:15,007 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:30:15,026 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-22 21:30:15,031 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-22 21:30:15,184 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-22 21:30:15,186 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-22 21:30:15,188 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-22 21:30:15,190 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-22 21:30:15,191 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-22 21:30:15,194 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-22 21:30:15,196 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-22 21:30:15,198 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-22 21:30:15,201 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-22 21:30:15,206 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-22 21:30:15,417 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:30:15,421 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:30:15,423 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-22 21:30:15,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:15,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:30:15,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:15,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:15,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:15,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:30:15,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:30:15,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:15,428 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-22 21:30:15,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:15,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:15,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:15,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:15,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:30:15,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:30:15,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:15,448 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-22 21:30:15,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:15,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:30:15,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:15,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:15,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:15,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:30:15,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:30:15,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:15,452 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-22 21:30:15,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:15,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:15,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:15,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:15,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:30:15,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:30:15,506 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:30:15,545 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-22 21:30:15,545 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-22 21:30:15,547 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:30:15,549 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 21:30:15,549 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:30:15,550 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2018-11-22 21:30:15,578 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-22 21:30:15,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:15,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:30:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:15,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:30:15,632 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-22 21:30:15,642 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-22 21:30:15,643 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 3 states. [2018-11-22 21:30:15,679 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 3 states. Result 39 states and 54 transitions. Complement of second has 7 states. [2018-11-22 21:30:15,680 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-22 21:30:15,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 21:30:15,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2018-11-22 21:30:15,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-22 21:30:15,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:30:15,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-22 21:30:15,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:30:15,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-22 21:30:15,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:30:15,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 54 transitions. [2018-11-22 21:30:15,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 21:30:15,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 13 states and 17 transitions. [2018-11-22 21:30:15,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-22 21:30:15,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-22 21:30:15,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2018-11-22 21:30:15,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 21:30:15,696 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-22 21:30:15,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2018-11-22 21:30:15,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-22 21:30:15,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-22 21:30:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-11-22 21:30:15,715 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-22 21:30:15,715 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-11-22 21:30:15,715 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 21:30:15,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2018-11-22 21:30:15,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 21:30:15,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:30:15,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:30:15,716 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:30:15,716 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-22 21:30:15,717 INFO L794 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 119#L-1 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; 120#L367 assume !(main_~length~0 < 1); 126#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 127#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 128#L371-3 assume !(main_~i~0 < main_~length~0); 131#L371-4 main_~j~0 := 0; 124#L374-3 [2018-11-22 21:30:15,717 INFO L796 eck$LassoCheckResult]: Loop: 124#L374-3 assume !!(main_~j~0 < main_~length~0); 121#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 122#L375-1 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 123#L374-2 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 124#L374-3 [2018-11-22 21:30:15,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:15,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815505, now seen corresponding path program 1 times [2018-11-22 21:30:15,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:30:15,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:30:15,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:15,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:30:15,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:15,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:15,730 INFO L82 PathProgramCache]: Analyzing trace with hash 2036812, now seen corresponding path program 1 times [2018-11-22 21:30:15,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:30:15,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:30:15,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:15,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:30:15,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:15,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:15,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1386095268, now seen corresponding path program 1 times [2018-11-22 21:30:15,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:30:15,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:30:15,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:15,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:30:15,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:15,894 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:30:15,894 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:30:15,894 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:30:15,894 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:30:15,895 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:30:15,895 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:30:15,895 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:30:15,895 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:30:15,895 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca_true-termination.c.i_Iteration2_Lasso [2018-11-22 21:30:15,895 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:30:15,895 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:30:15,898 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-22 21:30:15,900 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-22 21:30:15,902 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-22 21:30:15,904 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-22 21:30:15,905 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-22 21:30:15,908 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-22 21:30:15,984 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-22 21:30:15,985 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-22 21:30:15,986 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-22 21:30:15,988 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-22 21:30:15,989 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-22 21:30:16,101 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:30:16,101 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:30:16,101 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-22 21:30:16,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:16,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:30:16,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:16,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:16,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:16,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:30:16,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:30:16,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:16,104 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-22 21:30:16,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:16,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:30:16,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:16,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:16,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:16,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:30:16,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:30:16,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:16,109 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-22 21:30:16,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:16,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:30:16,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:16,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:16,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:16,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:30:16,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:30:16,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:16,111 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-22 21:30:16,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:16,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:30:16,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:16,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:16,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:16,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:30:16,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:30:16,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:16,113 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-22 21:30:16,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:16,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:16,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:16,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:16,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:30:16,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:30:16,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:16,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-22 21:30:16,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:16,116 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:30:16,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:16,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:16,118 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:30:16,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:30:16,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:16,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-22 21:30:16,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:16,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:16,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:16,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:16,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:30:16,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:30:16,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:16,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-22 21:30:16,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:16,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:16,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:16,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:16,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:30:16,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:30:16,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:16,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-22 21:30:16,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:16,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:16,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:16,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:16,131 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:30:16,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:30:16,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:16,137 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-22 21:30:16,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:16,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:16,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:16,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:16,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:30:16,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:30:16,155 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:30:16,174 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-22 21:30:16,174 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-22 21:30:16,175 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:30:16,176 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 21:30:16,176 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:30:16,176 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_2) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_2 Supporting invariants [] [2018-11-22 21:30:16,199 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2018-11-22 21:30:16,202 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 21:30:16,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:16,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:30:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:16,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:30:16,261 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-22 21:30:16,261 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-22 21:30:16,262 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-22 21:30:16,310 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 19 states and 25 transitions. Complement of second has 7 states. [2018-11-22 21:30:16,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-22 21:30:16,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 21:30:16,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-22 21:30:16,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-22 21:30:16,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:30:16,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-22 21:30:16,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:30:16,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 7 letters. Loop has 8 letters. [2018-11-22 21:30:16,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:30:16,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2018-11-22 21:30:16,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 21:30:16,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 24 transitions. [2018-11-22 21:30:16,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-22 21:30:16,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-22 21:30:16,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2018-11-22 21:30:16,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:30:16,317 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2018-11-22 21:30:16,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2018-11-22 21:30:16,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-11-22 21:30:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-22 21:30:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-11-22 21:30:16,319 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-22 21:30:16,319 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-22 21:30:16,319 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 21:30:16,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2018-11-22 21:30:16,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 21:30:16,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:30:16,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:30:16,321 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:30:16,321 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 21:30:16,321 INFO L794 eck$LassoCheckResult]: Stem: 235#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 230#L-1 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; 231#L367 assume !(main_~length~0 < 1); 236#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 237#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 238#L371-3 assume !(main_~i~0 < main_~length~0); 241#L371-4 main_~j~0 := 0; 234#L374-3 assume !!(main_~j~0 < main_~length~0); 226#L375-3 [2018-11-22 21:30:16,321 INFO L796 eck$LassoCheckResult]: Loop: 226#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 227#L375-1 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post212;havoc main_#t~mem211; 226#L375-3 [2018-11-22 21:30:16,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:16,322 INFO L82 PathProgramCache]: Analyzing trace with hash 176705843, now seen corresponding path program 1 times [2018-11-22 21:30:16,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:30:16,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:30:16,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:16,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:30:16,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:16,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:16,332 INFO L82 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 1 times [2018-11-22 21:30:16,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:30:16,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:30:16,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:16,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:30:16,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:16,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:16,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1984375400, now seen corresponding path program 1 times [2018-11-22 21:30:16,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:30:16,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:30:16,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:16,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:30:16,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:16,498 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-22 21:30:16,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:30:16,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 21:30:16,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 21:30:16,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-22 21:30:16,519 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-22 21:30:16,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:30:16,558 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2018-11-22 21:30:16,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 21:30:16,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2018-11-22 21:30:16,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 21:30:16,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 32 transitions. [2018-11-22 21:30:16,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-22 21:30:16,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-22 21:30:16,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 32 transitions. [2018-11-22 21:30:16,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:30:16,562 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-22 21:30:16,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 32 transitions. [2018-11-22 21:30:16,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-11-22 21:30:16,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-22 21:30:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2018-11-22 21:30:16,563 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-11-22 21:30:16,563 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2018-11-22 21:30:16,563 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 21:30:16,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2018-11-22 21:30:16,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 21:30:16,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:30:16,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:30:16,565 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:30:16,565 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 21:30:16,565 INFO L794 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 286#L-1 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; 287#L367 assume !(main_~length~0 < 1); 291#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 292#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 293#L371-3 assume !(main_~i~0 < main_~length~0); 297#L371-4 main_~j~0 := 0; 288#L374-3 assume !!(main_~j~0 < main_~length~0); 289#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 296#L375-1 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 284#L374-2 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 285#L374-3 assume !!(main_~j~0 < main_~length~0); 280#L375-3 [2018-11-22 21:30:16,565 INFO L796 eck$LassoCheckResult]: Loop: 280#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 281#L375-1 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post212;havoc main_#t~mem211; 280#L375-3 [2018-11-22 21:30:16,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:16,565 INFO L82 PathProgramCache]: Analyzing trace with hash -19280312, now seen corresponding path program 2 times [2018-11-22 21:30:16,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:30:16,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:30:16,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:16,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:30:16,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:30:16,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:30:16,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3baa01f-4669-4168-ba0d-17ebb45acdf2/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-22 21:30:16,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 21:30:16,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 21:30:16,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:30:16,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:30:16,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:30:16,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-22 21:30:16,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2018-11-22 21:30:16,699 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 21:30:16,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:16,699 INFO L82 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 2 times [2018-11-22 21:30:16,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:30:16,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:30:16,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:16,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:30:16,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:16,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-22 21:30:16,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-22 21:30:16,731 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 8 Second operand 11 states. [2018-11-22 21:30:16,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:30:16,791 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-22 21:30:16,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 21:30:16,792 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2018-11-22 21:30:16,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 21:30:16,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 19 states and 22 transitions. [2018-11-22 21:30:16,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-22 21:30:16,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-22 21:30:16,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-11-22 21:30:16,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 21:30:16,794 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-22 21:30:16,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-11-22 21:30:16,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-11-22 21:30:16,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-22 21:30:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-11-22 21:30:16,795 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-22 21:30:16,795 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-22 21:30:16,795 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 21:30:16,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-11-22 21:30:16,796 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 21:30:16,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 21:30:16,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 21:30:16,796 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:30:16,796 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 21:30:16,796 INFO L794 eck$LassoCheckResult]: Stem: 389#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 385#L-1 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; 386#L367 assume !(main_~length~0 < 1); 390#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.alloc(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 391#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);call write~int(0, main_~arr~0.base, main_~arr~0.offset, 4);main_~i~0 := 1; 394#L371-3 assume !!(main_~i~0 < main_~length~0);call main_#t~mem208 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * (main_~i~0 - 1), 4);call write~int(1 + main_#t~mem208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~mem208; 392#L371-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 393#L371-3 assume !(main_~i~0 < main_~length~0); 396#L371-4 main_~j~0 := 0; 387#L374-3 assume !!(main_~j~0 < main_~length~0); 388#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 395#L375-1 assume !(main_#t~mem210 > 0);havoc main_#t~mem210; 383#L374-2 main_#t~post209 := main_~j~0;main_~j~0 := 1 + main_#t~post209;havoc main_#t~post209; 384#L374-3 assume !!(main_~j~0 < main_~length~0); 379#L375-3 [2018-11-22 21:30:16,796 INFO L796 eck$LassoCheckResult]: Loop: 379#L375-3 call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 380#L375-1 assume !!(main_#t~mem210 > 0);havoc main_#t~mem210;call main_#t~mem211 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post212 := main_#t~mem211;call write~int(main_#t~post212 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~post212;havoc main_#t~mem211; 379#L375-3 [2018-11-22 21:30:16,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:16,797 INFO L82 PathProgramCache]: Analyzing trace with hash -744742010, now seen corresponding path program 1 times [2018-11-22 21:30:16,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:30:16,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:30:16,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:16,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:30:16,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:16,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:16,811 INFO L82 PathProgramCache]: Analyzing trace with hash 2278, now seen corresponding path program 3 times [2018-11-22 21:30:16,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:30:16,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:30:16,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:16,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:30:16,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:16,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:16,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1562468139, now seen corresponding path program 1 times [2018-11-22 21:30:16,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:30:16,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:30:16,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:16,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:30:16,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:30:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:30:16,997 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 68 [2018-11-22 21:30:17,027 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 21:30:17,027 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 21:30:17,027 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 21:30:17,027 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 21:30:17,027 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 21:30:17,027 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 21:30:17,027 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 21:30:17,027 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 21:30:17,027 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_up_and_down_alloca_true-termination.c.i_Iteration5_Lasso [2018-11-22 21:30:17,027 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 21:30:17,028 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 21:30:17,030 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-22 21:30:17,034 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-22 21:30:17,035 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-22 21:30:17,038 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-22 21:30:17,040 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-22 21:30:17,041 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-22 21:30:17,043 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-22 21:30:17,045 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-22 21:30:17,048 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-22 21:30:17,049 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-22 21:30:17,101 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-22 21:30:17,225 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 21:30:17,225 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 21:30:17,226 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-22 21:30:17,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:17,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:30:17,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:17,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:17,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:17,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:30:17,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:30:17,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:17,228 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-22 21:30:17,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:17,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:30:17,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:17,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:17,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:17,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:30:17,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:30:17,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:17,230 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-22 21:30:17,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:17,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:17,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:17,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:17,231 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:30:17,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:30:17,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:17,233 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-22 21:30:17,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:17,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:30:17,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:17,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:17,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:17,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:30:17,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:30:17,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:17,234 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-22 21:30:17,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:17,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:30:17,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:17,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:17,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:17,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:30:17,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:30:17,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:17,236 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-22 21:30:17,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:17,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:30:17,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:17,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:17,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:17,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:30:17,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:30:17,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:17,238 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-22 21:30:17,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:17,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:30:17,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:17,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:17,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:17,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:30:17,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:30:17,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:17,239 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-22 21:30:17,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:17,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:30:17,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:17,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:17,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:17,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:30:17,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:30:17,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:17,241 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-22 21:30:17,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:17,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:30:17,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:17,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:17,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:17,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:30:17,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:30:17,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:17,243 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-22 21:30:17,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:17,243 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 21:30:17,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:17,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:17,244 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 21:30:17,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:30:17,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:17,248 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-22 21:30:17,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:17,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:17,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:17,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:17,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 21:30:17,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 21:30:17,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 21:30:17,255 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-22 21:30:17,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 21:30:17,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 21:30:17,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 21:30:17,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 21:30:17,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 21:30:17,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 21:30:17,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 21:30:17,258 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 21:30:17,258 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 21:30:17,258 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 21:30:17,258 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 21:30:17,259 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-22 21:30:17,259 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 21:30:17,259 INFO L520 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))_1) = 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))_1 Supporting invariants [] [2018-11-22 21:30:17,268 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-22 21:30:17,269 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 21:30:17,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:17,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:30:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:17,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:30:17,328 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-22 21:30:17,328 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-22 21:30:17,328 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-22 21:30:17,341 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 24 transitions. Complement of second has 7 states. [2018-11-22 21:30:17,342 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-22 21:30:17,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 21:30:17,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-22 21:30:17,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-22 21:30:17,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:30:17,342 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 21:30:17,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:17,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:30:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:17,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:30:17,370 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-22 21:30:17,370 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 21:30:17,370 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-22 21:30:17,378 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 24 transitions. Complement of second has 7 states. [2018-11-22 21:30:17,379 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-22 21:30:17,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 21:30:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-22 21:30:17,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-22 21:30:17,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:30:17,380 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 21:30:17,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:30:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:17,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:30:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:30:17,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:30:17,415 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-22 21:30:17,416 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 2 loop predicates [2018-11-22 21:30:17,416 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-22 21:30:17,426 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 23 states and 28 transitions. Complement of second has 6 states. [2018-11-22 21:30:17,426 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-22 21:30:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 21:30:17,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-22 21:30:17,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 2 letters. [2018-11-22 21:30:17,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:30:17,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-22 21:30:17,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:30:17,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 4 letters. [2018-11-22 21:30:17,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 21:30:17,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 28 transitions. [2018-11-22 21:30:17,428 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 21:30:17,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 0 states and 0 transitions. [2018-11-22 21:30:17,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 21:30:17,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 21:30:17,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 21:30:17,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 21:30:17,429 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:30:17,429 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:30:17,429 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:30:17,429 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 21:30:17,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-22 21:30:17,429 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 21:30:17,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-22 21:30:17,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 09:30:17 BoogieIcfgContainer [2018-11-22 21:30:17,434 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 21:30:17,434 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:30:17,434 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:30:17,434 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:30:17,435 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:30:14" (3/4) ... [2018-11-22 21:30:17,437 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 21:30:17,437 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:30:17,438 INFO L168 Benchmark]: Toolchain (without parser) took 3503.61 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 229.1 MB). Free memory was 955.4 MB in the beginning and 1.0 GB in the end (delta: -63.0 MB). Peak memory consumption was 166.1 MB. Max. memory is 11.5 GB. [2018-11-22 21:30:17,439 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:30:17,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 411.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:30:17,440 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-22 21:30:17,440 INFO L168 Benchmark]: Boogie Preprocessor took 16.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:30:17,440 INFO L168 Benchmark]: RCFGBuilder took 170.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2018-11-22 21:30:17,441 INFO L168 Benchmark]: BuchiAutomizer took 2872.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.0 MB). Peak memory consumption was 164.5 MB. Max. memory is 11.5 GB. [2018-11-22 21:30:17,441 INFO L168 Benchmark]: Witness Printer took 3.16 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:30:17,444 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 411.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 955.4 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 170.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2872.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 65.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.0 MB). Peak memory consumption was 164.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.16 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function -1 * arr + -4 * j + unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][4 * j + arr] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 74 SDtfs, 135 SDslu, 46 SDs, 0 SdLazy, 111 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital122 mio100 ax100 hnf99 lsp95 ukn77 mio100 lsp61 div100 bol100 ite100 ukn100 eq165 hnf88 smp92 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 2 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...