./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-crafted/TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/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 687269bb6882b72a3d48999f1e5c55a1d5283a94 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:55:54,387 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:55:54,388 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:55:54,398 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:55:54,398 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:55:54,399 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:55:54,400 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:55:54,401 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:55:54,402 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:55:54,403 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:55:54,404 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:55:54,404 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:55:54,405 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:55:54,406 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:55:54,406 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:55:54,407 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:55:54,408 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:55:54,409 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:55:54,410 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:55:54,412 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:55:54,412 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:55:54,413 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:55:54,415 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:55:54,415 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:55:54,415 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:55:54,416 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:55:54,417 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:55:54,417 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:55:54,418 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:55:54,419 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:55:54,419 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:55:54,419 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:55:54,419 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:55:54,420 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:55:54,420 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:55:54,421 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:55:54,421 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 03:55:54,433 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:55:54,433 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:55:54,434 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:55:54,434 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:55:54,434 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:55:54,435 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 03:55:54,435 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 03:55:54,435 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 03:55:54,435 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 03:55:54,435 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 03:55:54,435 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 03:55:54,435 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:55:54,436 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:55:54,436 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:55:54,436 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:55:54,436 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 03:55:54,436 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 03:55:54,436 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 03:55:54,436 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:55:54,437 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 03:55:54,437 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 03:55:54,437 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:55:54,437 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:55:54,437 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 03:55:54,437 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:55:54,438 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:55:54,438 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 03:55:54,438 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 03:55:54,439 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_d3bf629c-cf04-4700-85fe-c55ada192e7c/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 -> 687269bb6882b72a3d48999f1e5c55a1d5283a94 [2018-11-10 03:55:54,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:55:54,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:55:54,471 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:55:54,472 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:55:54,472 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:55:54,473 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 03:55:54,510 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/data/d774f0ffe/58a0e5ea06744fc79231a2a8697d325f/FLAG6aa62e456 [2018-11-10 03:55:54,907 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:55:54,907 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/sv-benchmarks/c/termination-crafted/TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 03:55:54,911 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/data/d774f0ffe/58a0e5ea06744fc79231a2a8697d325f/FLAG6aa62e456 [2018-11-10 03:55:54,919 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/data/d774f0ffe/58a0e5ea06744fc79231a2a8697d325f [2018-11-10 03:55:54,921 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:55:54,922 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:55:54,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:55:54,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:55:54,925 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:55:54,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:55:54" (1/1) ... [2018-11-10 03:55:54,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb581ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:55:54, skipping insertion in model container [2018-11-10 03:55:54,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:55:54" (1/1) ... [2018-11-10 03:55:54,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:55:54,943 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:55:55,030 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:55:55,032 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:55:55,041 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:55:55,049 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:55:55,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:55:55 WrapperNode [2018-11-10 03:55:55,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:55:55,050 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:55:55,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:55:55,050 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:55:55,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:55:55" (1/1) ... [2018-11-10 03:55:55,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:55:55" (1/1) ... [2018-11-10 03:55:55,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:55:55,075 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:55:55,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:55:55,075 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:55:55,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:55:55" (1/1) ... [2018-11-10 03:55:55,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:55:55" (1/1) ... [2018-11-10 03:55:55,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:55:55" (1/1) ... [2018-11-10 03:55:55,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:55:55" (1/1) ... [2018-11-10 03:55:55,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:55:55" (1/1) ... [2018-11-10 03:55:55,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:55:55" (1/1) ... [2018-11-10 03:55:55,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:55:55" (1/1) ... [2018-11-10 03:55:55,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:55:55,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:55:55,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:55:55,088 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:55:55,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:55:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:55,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:55:55,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:55:55,270 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:55:55,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:55:55 BoogieIcfgContainer [2018-11-10 03:55:55,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:55:55,271 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 03:55:55,271 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 03:55:55,274 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 03:55:55,275 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:55:55,275 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 03:55:54" (1/3) ... [2018-11-10 03:55:55,276 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@695ef345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:55:55, skipping insertion in model container [2018-11-10 03:55:55,276 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:55:55,276 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:55:55" (2/3) ... [2018-11-10 03:55:55,276 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@695ef345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:55:55, skipping insertion in model container [2018-11-10 03:55:55,276 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:55:55,276 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:55:55" (3/3) ... [2018-11-10 03:55:55,278 INFO L375 chiAutomizerObserver]: Analyzing ICFG TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-10 03:55:55,327 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:55:55,327 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 03:55:55,327 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 03:55:55,328 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 03:55:55,328 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:55:55,328 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:55:55,328 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 03:55:55,328 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:55:55,328 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 03:55:55,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-10 03:55:55,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:55:55,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:55:55,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:55:55,362 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 03:55:55,362 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:55:55,362 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 03:55:55,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-10 03:55:55,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:55:55,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:55:55,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:55:55,364 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 03:55:55,364 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:55:55,369 INFO L793 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 10#L25-2true [2018-11-10 03:55:55,370 INFO L795 eck$LassoCheckResult]: Loop: 10#L25-2true assume true; 11#L24-1true assume !!(main_~x~0 > 0 && main_~y~0 > 0); 15#L25true assume main_#t~nondet2 != 0;havoc main_#t~nondet2; 3#L26true assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 13#L26-2true main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 10#L25-2true [2018-11-10 03:55:55,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:55,374 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 03:55:55,375 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:55,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:55,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:55,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:55,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:55,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:55,439 INFO L82 PathProgramCache]: Analyzing trace with hash 34542764, now seen corresponding path program 1 times [2018-11-10 03:55:55,440 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:55,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:55,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:55,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:55,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:55,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:55,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1805982250, now seen corresponding path program 1 times [2018-11-10 03:55:55,457 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:55,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:55,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:55,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:55,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:55,553 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:55:55,554 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:55:55,554 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:55:55,554 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:55:55,555 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:55:55,555 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:55,555 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:55:55,555 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:55:55,555 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2018-11-10 03:55:55,555 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:55:55,555 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:55:55,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:55,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:55,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:55,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:55,741 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:55:55,742 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:55,750 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:55,750 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:55,778 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:55,778 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:55,781 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:55,781 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:55,799 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:55,799 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:55,802 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:55,802 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:55,824 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:55:55,824 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:55,872 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:55:55,874 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:55:55,874 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:55:55,874 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:55:55,874 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:55:55,874 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:55:55,874 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:55,874 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:55:55,874 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:55:55,875 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2018-11-10 03:55:55,875 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:55:55,875 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:55:55,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:55,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:55,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-10 03:55:55,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:55,947 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:55:55,950 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:55:55,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:55,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:55,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:55,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:55,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:55,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:55,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:55,966 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:55,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:55,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:55,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:55,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:55,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:55,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:55,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:55,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:55,980 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:55:55,984 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:55:55,984 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:55:55,986 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:55:55,986 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:55:55,986 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:55:55,987 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-11-10 03:55:55,987 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:55:56,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:56,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:56,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:56,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:55:56,099 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 03:55:56,100 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 5 states. [2018-11-10 03:55:56,142 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 5 states. Result 43 states and 55 transitions. Complement of second has 8 states. [2018-11-10 03:55:56,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:55:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 03:55:56,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-10 03:55:56,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-10 03:55:56,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:56,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-10 03:55:56,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:56,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-10 03:55:56,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:56,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 55 transitions. [2018-11-10 03:55:56,149 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-10 03:55:56,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 25 states and 33 transitions. [2018-11-10 03:55:56,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 03:55:56,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 03:55:56,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2018-11-10 03:55:56,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:55:56,154 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-11-10 03:55:56,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2018-11-10 03:55:56,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-11-10 03:55:56,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 03:55:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-11-10 03:55:56,172 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-10 03:55:56,173 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-10 03:55:56,173 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 03:55:56,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2018-11-10 03:55:56,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-10 03:55:56,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:55:56,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:55:56,174 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-10 03:55:56,174 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:55:56,174 INFO L793 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 108#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 109#L25-2 assume true; 122#L24-1 [2018-11-10 03:55:56,174 INFO L795 eck$LassoCheckResult]: Loop: 122#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 126#L25 assume main_#t~nondet2 != 0;havoc main_#t~nondet2; 110#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 111#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 121#L25-2 assume true; 122#L24-1 [2018-11-10 03:55:56,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:56,175 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-10 03:55:56,175 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:56,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:56,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:56,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:56,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:56,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:56,179 INFO L82 PathProgramCache]: Analyzing trace with hash 40178176, now seen corresponding path program 1 times [2018-11-10 03:55:56,179 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:56,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:56,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:56,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:56,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:56,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:56,186 INFO L82 PathProgramCache]: Analyzing trace with hash 150876830, now seen corresponding path program 1 times [2018-11-10 03:55:56,186 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:56,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:56,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:56,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:56,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:56,221 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:55:56,221 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:55:56,221 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:55:56,221 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:55:56,221 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:55:56,221 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:56,221 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:55:56,222 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:55:56,222 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2018-11-10 03:55:56,222 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:55:56,222 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:55:56,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:56,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:56,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:56,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:56,298 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:55:56,298 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:56,301 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:56,301 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:56,321 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:56,321 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:56,331 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:56,331 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:56,361 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:56,361 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:56,365 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:56,365 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:56,402 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:55:56,402 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:56,443 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:55:56,445 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:55:56,445 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:55:56,445 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:55:56,446 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:55:56,446 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:55:56,446 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:56,446 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:55:56,446 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:55:56,446 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2018-11-10 03:55:56,446 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:55:56,446 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:55:56,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:56,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:56,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:56,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:56,539 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:55:56,540 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:55:56,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:56,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:56,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:56,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:56,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:56,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:56,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:56,548 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:56,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:56,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:56,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:56,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:56,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:56,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:56,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:56,559 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:56,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:56,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:56,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:56,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:56,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:56,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:56,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:56,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:56,568 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:55:56,572 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:55:56,573 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:55:56,573 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:55:56,573 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:55:56,573 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:55:56,574 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-11-10 03:55:56,574 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:55:56,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:56,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:56,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:55:56,637 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 03:55:56,638 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 10 Second operand 4 states. [2018-11-10 03:55:56,651 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 38 states and 52 transitions. Complement of second has 7 states. [2018-11-10 03:55:56,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:55:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:55:56,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2018-11-10 03:55:56,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 3 letters. Loop has 5 letters. [2018-11-10 03:55:56,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:56,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-10 03:55:56,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:56,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-10 03:55:56,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:56,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 52 transitions. [2018-11-10 03:55:56,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:55:56,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 31 states and 41 transitions. [2018-11-10 03:55:56,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 03:55:56,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-10 03:55:56,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 41 transitions. [2018-11-10 03:55:56,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:55:56,656 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2018-11-10 03:55:56,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 41 transitions. [2018-11-10 03:55:56,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2018-11-10 03:55:56,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-10 03:55:56,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2018-11-10 03:55:56,657 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-11-10 03:55:56,658 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-11-10 03:55:56,658 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 03:55:56,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2018-11-10 03:55:56,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:55:56,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:55:56,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:55:56,658 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 03:55:56,659 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:55:56,659 INFO L793 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 216#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 217#L25-2 assume true; 236#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 229#L25 assume !(main_#t~nondet2 != 0);havoc main_#t~nondet2; 223#L33 [2018-11-10 03:55:56,659 INFO L795 eck$LassoCheckResult]: Loop: 223#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 214#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 215#L25-2 assume true; 235#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 234#L25 assume !(main_#t~nondet2 != 0);havoc main_#t~nondet2; 223#L33 [2018-11-10 03:55:56,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:56,659 INFO L82 PathProgramCache]: Analyzing trace with hash 28694895, now seen corresponding path program 1 times [2018-11-10 03:55:56,659 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:56,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:56,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:56,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:56,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:56,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:56,664 INFO L82 PathProgramCache]: Analyzing trace with hash 54493901, now seen corresponding path program 1 times [2018-11-10 03:55:56,664 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:56,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:56,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:56,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:56,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:56,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:56,669 INFO L82 PathProgramCache]: Analyzing trace with hash -771858913, now seen corresponding path program 1 times [2018-11-10 03:55:56,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:56,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:56,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:56,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:56,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:56,698 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:55:56,698 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:55:56,698 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:55:56,698 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:55:56,698 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:55:56,698 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:56,698 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:55:56,698 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:55:56,699 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2018-11-10 03:55:56,699 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:55:56,699 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:55:56,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:56,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:56,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:56,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:56,770 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:55:56,770 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:56,772 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:56,773 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:56,776 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:56,776 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:56,794 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:56,794 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:56,813 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:56,813 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:56,816 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:56,817 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:56,835 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:56,835 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:56,838 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:56,838 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:56,858 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:55:56,858 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:56,957 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:55:56,958 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:55:56,959 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:55:56,959 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:55:56,959 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:55:56,959 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:55:56,959 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:56,959 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:55:56,959 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:55:56,959 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2018-11-10 03:55:56,959 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:55:56,959 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:55:56,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:56,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:56,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:56,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:57,030 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:55:57,031 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:55:57,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:57,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:57,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:57,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:57,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:57,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:57,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:57,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:57,034 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:57,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:57,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:57,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:57,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:57,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:57,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:57,036 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:57,040 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:57,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:57,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:57,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:57,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:57,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:57,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:57,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:57,045 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:57,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:57,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:57,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:57,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:57,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:57,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:57,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:57,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:57,051 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:55:57,055 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:55:57,056 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:55:57,056 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:55:57,056 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:55:57,056 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:55:57,056 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-10 03:55:57,057 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:55:57,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:57,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:57,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:57,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:55:57,104 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 03:55:57,104 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-10 03:55:57,128 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 41 states and 58 transitions. Complement of second has 7 states. [2018-11-10 03:55:57,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:55:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:55:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-10 03:55:57,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 5 letters. Loop has 5 letters. [2018-11-10 03:55:57,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:57,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-10 03:55:57,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:57,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-10 03:55:57,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:57,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 58 transitions. [2018-11-10 03:55:57,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:55:57,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 34 states and 47 transitions. [2018-11-10 03:55:57,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-10 03:55:57,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-10 03:55:57,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 47 transitions. [2018-11-10 03:55:57,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:55:57,135 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 47 transitions. [2018-11-10 03:55:57,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 47 transitions. [2018-11-10 03:55:57,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-10 03:55:57,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-10 03:55:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2018-11-10 03:55:57,138 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2018-11-10 03:55:57,138 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2018-11-10 03:55:57,138 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 03:55:57,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2018-11-10 03:55:57,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 03:55:57,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:55:57,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:55:57,140 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 03:55:57,140 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:55:57,140 INFO L793 eck$LassoCheckResult]: Stem: 346#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 340#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 341#L25-2 assume true; 362#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 353#L25 assume !(main_#t~nondet2 != 0);havoc main_#t~nondet2; 347#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 338#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 339#L25-2 assume true; 360#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 358#L25 assume main_#t~nondet2 != 0;havoc main_#t~nondet2; 342#L26 [2018-11-10 03:55:57,140 INFO L795 eck$LassoCheckResult]: Loop: 342#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 343#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 337#L25-2 assume true; 361#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 359#L25 assume main_#t~nondet2 != 0;havoc main_#t~nondet2; 342#L26 [2018-11-10 03:55:57,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:57,141 INFO L82 PathProgramCache]: Analyzing trace with hash -770011880, now seen corresponding path program 1 times [2018-11-10 03:55:57,141 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:57,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:57,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:57,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:57,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:57,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:57,148 INFO L82 PathProgramCache]: Analyzing trace with hash 45914084, now seen corresponding path program 2 times [2018-11-10 03:55:57,149 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:57,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:57,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:57,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:57,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:57,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:57,155 INFO L82 PathProgramCache]: Analyzing trace with hash 863084845, now seen corresponding path program 1 times [2018-11-10 03:55:57,155 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:57,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:57,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:57,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:57,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:57,193 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:55:57,193 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:55:57,193 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:55:57,193 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:55:57,193 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:55:57,193 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:57,193 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:55:57,193 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:55:57,193 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2018-11-10 03:55:57,193 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:55:57,193 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:55:57,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-10 03:55:57,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-10 03:55:57,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-10 03:55:57,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:57,248 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:55:57,248 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:57,251 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:57,251 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:57,253 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:57,253 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=7} Honda state: {ULTIMATE.start_main_#t~nondet2=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:57,270 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:57,270 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:57,288 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:57,288 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:57,291 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:57,291 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:57,308 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:57,308 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:57,311 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:57,311 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:57,335 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:55:57,335 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:57,438 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:55:57,439 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:55:57,440 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:55:57,440 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:55:57,440 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:55:57,440 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:55:57,440 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:57,440 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:55:57,440 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:55:57,440 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2018-11-10 03:55:57,440 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:55:57,441 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:55:57,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:57,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:57,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:57,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:57,498 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:55:57,499 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:55:57,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:57,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:57,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:57,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:57,500 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:55:57,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:57,501 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:55:57,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:57,503 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:57,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:57,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:57,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:57,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:57,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:57,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:57,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:57,508 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:57,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:57,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:57,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:57,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:57,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:57,510 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:57,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:57,512 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:57,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:57,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:57,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:57,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:57,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:57,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:57,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:57,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:57,519 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:55:57,522 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:55:57,522 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:55:57,522 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:55:57,523 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:55:57,523 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:55:57,523 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-11-10 03:55:57,523 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:55:57,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:57,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:57,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:55:57,589 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 03:55:57,589 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 44 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-11-10 03:55:57,620 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 44 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 109 states and 146 transitions. Complement of second has 7 states. [2018-11-10 03:55:57,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:55:57,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:55:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-10 03:55:57,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 10 letters. Loop has 5 letters. [2018-11-10 03:55:57,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:57,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-10 03:55:57,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:57,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 10 letters. Loop has 10 letters. [2018-11-10 03:55:57,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:57,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 146 transitions. [2018-11-10 03:55:57,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-10 03:55:57,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 75 states and 100 transitions. [2018-11-10 03:55:57,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 03:55:57,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-10 03:55:57,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 100 transitions. [2018-11-10 03:55:57,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:55:57,626 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 100 transitions. [2018-11-10 03:55:57,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 100 transitions. [2018-11-10 03:55:57,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2018-11-10 03:55:57,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 03:55:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2018-11-10 03:55:57,629 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 78 transitions. [2018-11-10 03:55:57,629 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 78 transitions. [2018-11-10 03:55:57,629 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 03:55:57,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 78 transitions. [2018-11-10 03:55:57,630 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-10 03:55:57,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:55:57,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:55:57,630 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:55:57,630 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:55:57,631 INFO L793 eck$LassoCheckResult]: Stem: 558#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 551#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 552#L25-2 assume true; 589#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 586#L25 assume !(main_#t~nondet2 != 0);havoc main_#t~nondet2; 583#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 549#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 550#L25-2 assume true; 588#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 584#L25 assume main_#t~nondet2 != 0;havoc main_#t~nondet2; 585#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 554#L26-2 [2018-11-10 03:55:57,631 INFO L795 eck$LassoCheckResult]: Loop: 554#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 569#L25-2 assume true; 566#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 567#L25 assume main_#t~nondet2 != 0;havoc main_#t~nondet2; 553#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 554#L26-2 [2018-11-10 03:55:57,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:57,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1899435516, now seen corresponding path program 1 times [2018-11-10 03:55:57,631 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:57,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:57,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:57,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:57,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:57,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:57,636 INFO L82 PathProgramCache]: Analyzing trace with hash 49137376, now seen corresponding path program 2 times [2018-11-10 03:55:57,636 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:57,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:57,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:57,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:57,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:57,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:57,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1043084741, now seen corresponding path program 1 times [2018-11-10 03:55:57,640 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:57,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:57,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:57,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:57,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:57,684 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:55:57,684 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:55:57,684 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:55:57,684 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:55:57,684 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:55:57,684 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:57,685 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:55:57,685 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:55:57,685 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2018-11-10 03:55:57,685 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:55:57,685 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:55:57,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:57,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:57,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:57,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:57,751 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:55:57,751 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:57,753 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:57,753 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:57,769 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:57,769 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:57,772 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:57,772 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:57,788 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:57,788 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:57,790 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:57,791 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:57,794 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:57,794 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=7} Honda state: {ULTIMATE.start_main_#t~nondet2=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:57,810 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:57,810 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:57,828 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:55:57,828 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:57,848 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:55:57,849 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:55:57,849 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:55:57,849 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:55:57,849 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:55:57,849 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:55:57,849 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:57,849 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:55:57,849 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:55:57,849 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2018-11-10 03:55:57,849 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:55:57,849 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:55:57,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:57,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:57,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:57,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:57,892 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:55:57,892 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:55:57,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:57,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:57,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:57,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:57,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:57,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:57,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:57,895 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:57,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:57,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:57,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:57,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:57,895 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:55:57,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:57,896 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:55:57,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:57,897 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:57,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:57,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:57,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:57,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:57,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:57,898 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:57,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:57,900 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:57,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:57,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:57,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:57,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:57,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:57,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:57,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:57,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:57,903 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:55:57,905 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:55:57,905 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:55:57,905 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:55:57,905 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:55:57,906 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:55:57,906 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-11-10 03:55:57,906 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:55:57,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:57,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:57,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:55:57,928 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 03:55:57,929 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 78 transitions. cyclomatic complexity: 28 Second operand 4 states. [2018-11-10 03:55:57,939 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 78 transitions. cyclomatic complexity: 28. Second operand 4 states. Result 143 states and 195 transitions. Complement of second has 7 states. [2018-11-10 03:55:57,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:55:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:55:57,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-10 03:55:57,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-10 03:55:57,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:57,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-10 03:55:57,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:57,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-10 03:55:57,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:57,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 195 transitions. [2018-11-10 03:55:57,943 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-10 03:55:57,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 114 states and 153 transitions. [2018-11-10 03:55:57,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-10 03:55:57,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 03:55:57,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 153 transitions. [2018-11-10 03:55:57,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:55:57,944 INFO L705 BuchiCegarLoop]: Abstraction has 114 states and 153 transitions. [2018-11-10 03:55:57,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 153 transitions. [2018-11-10 03:55:57,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 94. [2018-11-10 03:55:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-10 03:55:57,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 130 transitions. [2018-11-10 03:55:57,950 INFO L728 BuchiCegarLoop]: Abstraction has 94 states and 130 transitions. [2018-11-10 03:55:57,950 INFO L608 BuchiCegarLoop]: Abstraction has 94 states and 130 transitions. [2018-11-10 03:55:57,950 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 03:55:57,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 130 transitions. [2018-11-10 03:55:57,951 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-10 03:55:57,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:55:57,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:55:57,952 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:55:57,952 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:55:57,952 INFO L793 eck$LassoCheckResult]: Stem: 828#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 823#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 824#L25-2 assume true; 864#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 909#L25 assume main_#t~nondet2 != 0;havoc main_#t~nondet2; 908#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 906#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 905#L25-2 assume true; 904#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 903#L25 assume !(main_#t~nondet2 != 0);havoc main_#t~nondet2; 898#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 902#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 901#L25-2 assume true; 892#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 893#L25 assume main_#t~nondet2 != 0;havoc main_#t~nondet2; 896#L26 [2018-11-10 03:55:57,952 INFO L795 eck$LassoCheckResult]: Loop: 896#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 837#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 820#L25-2 assume true; 890#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 891#L25 assume main_#t~nondet2 != 0;havoc main_#t~nondet2; 896#L26 [2018-11-10 03:55:57,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:57,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1372736639, now seen corresponding path program 2 times [2018-11-10 03:55:57,952 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:57,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:57,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:57,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:57,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:57,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:57,961 INFO L82 PathProgramCache]: Analyzing trace with hash 45914084, now seen corresponding path program 3 times [2018-11-10 03:55:57,961 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:57,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:57,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:57,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:57,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:57,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:57,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1954780634, now seen corresponding path program 3 times [2018-11-10 03:55:57,965 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:57,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:57,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:57,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:57,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:57,996 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:55:57,997 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:55:57,997 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:55:57,997 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:55:57,997 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:55:57,997 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:57,997 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:55:57,997 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:55:57,997 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2018-11-10 03:55:57,997 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:55:57,997 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:55:57,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:57,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:58,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:58,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:58,038 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:55:58,038 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:58,046 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:58,046 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:58,062 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:58,062 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:58,065 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:58,065 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:58,080 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:58,080 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:58,083 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:58,083 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:58,103 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:55:58,103 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:58,200 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:55:58,202 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:55:58,202 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:55:58,202 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:55:58,202 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:55:58,202 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:55:58,202 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:58,202 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:55:58,202 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:55:58,202 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2018-11-10 03:55:58,202 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:55:58,202 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:55:58,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:58,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:58,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:58,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:58,248 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:55:58,249 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:55:58,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:58,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:58,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:58,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:58,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:58,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:58,251 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:58,254 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:58,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:58,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:58,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:58,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:58,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:58,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:58,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:58,257 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:58,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:58,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:58,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:58,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:58,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:58,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:58,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:58,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:58,261 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:55:58,263 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:55:58,263 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:55:58,263 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:55:58,263 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:55:58,264 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:55:58,264 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-11-10 03:55:58,264 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:55:58,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:58,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:58,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:58,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:55:58,297 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 03:55:58,297 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 130 transitions. cyclomatic complexity: 48 Second operand 4 states. [2018-11-10 03:55:58,314 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 130 transitions. cyclomatic complexity: 48. Second operand 4 states. Result 190 states and 257 transitions. Complement of second has 7 states. [2018-11-10 03:55:58,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:55:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:55:58,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-10 03:55:58,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-10 03:55:58,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:58,318 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:55:58,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:58,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:58,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:58,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:55:58,355 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 03:55:58,356 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 130 transitions. cyclomatic complexity: 48 Second operand 4 states. [2018-11-10 03:55:58,379 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 130 transitions. cyclomatic complexity: 48. Second operand 4 states. Result 200 states and 268 transitions. Complement of second has 9 states. [2018-11-10 03:55:58,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-10 03:55:58,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:55:58,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-10 03:55:58,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-10 03:55:58,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:58,381 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:55:58,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:58,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:58,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:55:58,418 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 3 loop predicates [2018-11-10 03:55:58,418 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 130 transitions. cyclomatic complexity: 48 Second operand 4 states. [2018-11-10 03:55:58,442 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 130 transitions. cyclomatic complexity: 48. Second operand 4 states. Result 231 states and 321 transitions. Complement of second has 9 states. [2018-11-10 03:55:58,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:55:58,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:55:58,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2018-11-10 03:55:58,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-10 03:55:58,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:58,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 20 letters. Loop has 5 letters. [2018-11-10 03:55:58,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:58,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 15 letters. Loop has 10 letters. [2018-11-10 03:55:58,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:58,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231 states and 321 transitions. [2018-11-10 03:55:58,447 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 38 [2018-11-10 03:55:58,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231 states to 150 states and 205 transitions. [2018-11-10 03:55:58,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-11-10 03:55:58,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-10 03:55:58,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 205 transitions. [2018-11-10 03:55:58,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:55:58,449 INFO L705 BuchiCegarLoop]: Abstraction has 150 states and 205 transitions. [2018-11-10 03:55:58,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 205 transitions. [2018-11-10 03:55:58,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 93. [2018-11-10 03:55:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-10 03:55:58,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2018-11-10 03:55:58,453 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 128 transitions. [2018-11-10 03:55:58,453 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 128 transitions. [2018-11-10 03:55:58,453 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 03:55:58,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 128 transitions. [2018-11-10 03:55:58,454 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2018-11-10 03:55:58,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:55:58,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:55:58,454 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 03:55:58,454 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 03:55:58,455 INFO L793 eck$LassoCheckResult]: Stem: 1775#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1768#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 1769#L25-2 assume true; 1812#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1789#L25 assume !(main_#t~nondet2 != 0);havoc main_#t~nondet2; 1776#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 1766#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 1767#L25-2 assume true; 1814#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1805#L25 assume main_#t~nondet2 != 0;havoc main_#t~nondet2; 1770#L26 [2018-11-10 03:55:58,455 INFO L795 eck$LassoCheckResult]: Loop: 1770#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 1771#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 1824#L25-2 assume true; 1818#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1815#L25 assume !(main_#t~nondet2 != 0);havoc main_#t~nondet2; 1804#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 1808#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 1807#L25-2 assume true; 1806#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 1803#L25 assume main_#t~nondet2 != 0;havoc main_#t~nondet2; 1770#L26 [2018-11-10 03:55:58,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:58,455 INFO L82 PathProgramCache]: Analyzing trace with hash -770011880, now seen corresponding path program 2 times [2018-11-10 03:55:58,455 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:58,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:58,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:58,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:58,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:58,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:58,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1803485608, now seen corresponding path program 1 times [2018-11-10 03:55:58,460 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:58,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:58,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:58,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:58,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:58,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:58,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:58,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1696291503, now seen corresponding path program 1 times [2018-11-10 03:55:58,465 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:58,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:58,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:58,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:58,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:58,509 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:55:58,509 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:55:58,509 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:55:58,509 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:55:58,509 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:55:58,509 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:58,510 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:55:58,510 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:55:58,510 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2018-11-10 03:55:58,510 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:55:58,510 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:55:58,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:58,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:58,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:58,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:58,553 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:55:58,553 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:58,556 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:58,556 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:58,558 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:58,558 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:58,574 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:58,574 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:58,590 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:58,590 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:58,592 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:58,593 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:58,608 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:58,608 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:58,611 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:58,611 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:58,630 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:55:58,631 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:58,747 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:55:58,748 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:55:58,748 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:55:58,748 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:55:58,748 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:55:58,749 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:55:58,749 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:58,749 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:55:58,749 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:55:58,749 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2018-11-10 03:55:58,749 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:55:58,749 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:55:58,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:58,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:58,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:58,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:58,789 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:55:58,789 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:55:58,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:58,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:58,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:58,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:58,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:58,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:58,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:58,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:58,790 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:58,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:58,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:58,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:58,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:58,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:58,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:58,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:58,793 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:58,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:58,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:58,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:58,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:58,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:58,795 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:58,795 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:58,796 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:58,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:58,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:58,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:58,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:58,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:58,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:58,797 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:58,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:58,800 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:55:58,803 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:55:58,803 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:55:58,803 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:55:58,803 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:55:58,803 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:55:58,803 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-10 03:55:58,803 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:55:58,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:58,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:58,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:55:58,839 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-10 03:55:58,839 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 128 transitions. cyclomatic complexity: 44 Second operand 5 states. [2018-11-10 03:55:58,882 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 128 transitions. cyclomatic complexity: 44. Second operand 5 states. Result 262 states and 370 transitions. Complement of second has 12 states. [2018-11-10 03:55:58,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 03:55:58,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 03:55:58,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2018-11-10 03:55:58,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 10 letters. Loop has 10 letters. [2018-11-10 03:55:58,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:58,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 20 letters. Loop has 10 letters. [2018-11-10 03:55:58,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:58,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 36 transitions. Stem has 10 letters. Loop has 20 letters. [2018-11-10 03:55:58,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:58,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 262 states and 370 transitions. [2018-11-10 03:55:58,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2018-11-10 03:55:58,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 262 states to 250 states and 357 transitions. [2018-11-10 03:55:58,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 03:55:58,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-11-10 03:55:58,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 250 states and 357 transitions. [2018-11-10 03:55:58,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:55:58,890 INFO L705 BuchiCegarLoop]: Abstraction has 250 states and 357 transitions. [2018-11-10 03:55:58,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states and 357 transitions. [2018-11-10 03:55:58,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 207. [2018-11-10 03:55:58,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-10 03:55:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 299 transitions. [2018-11-10 03:55:58,900 INFO L728 BuchiCegarLoop]: Abstraction has 207 states and 299 transitions. [2018-11-10 03:55:58,900 INFO L608 BuchiCegarLoop]: Abstraction has 207 states and 299 transitions. [2018-11-10 03:55:58,900 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 03:55:58,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 207 states and 299 transitions. [2018-11-10 03:55:58,901 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2018-11-10 03:55:58,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:55:58,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:55:58,902 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:55:58,902 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 03:55:58,902 INFO L793 eck$LassoCheckResult]: Stem: 2227#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2219#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 2220#L25-2 assume true; 2296#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 2295#L25 assume !(main_#t~nondet2 != 0);havoc main_#t~nondet2; 2294#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 2293#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 2291#L25-2 assume true; 2289#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 2256#L25 assume main_#t~nondet2 != 0;havoc main_#t~nondet2; 2258#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 2222#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 2278#L25-2 assume true; 2276#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 2272#L25 assume !(main_#t~nondet2 != 0);havoc main_#t~nondet2; 2266#L33 [2018-11-10 03:55:58,902 INFO L795 eck$LassoCheckResult]: Loop: 2266#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 2263#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 2262#L25-2 assume true; 2261#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 2259#L25 assume main_#t~nondet2 != 0;havoc main_#t~nondet2; 2221#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 2222#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 2278#L25-2 assume true; 2276#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 2272#L25 assume !(main_#t~nondet2 != 0);havoc main_#t~nondet2; 2266#L33 [2018-11-10 03:55:58,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:58,902 INFO L82 PathProgramCache]: Analyzing trace with hash 863084854, now seen corresponding path program 4 times [2018-11-10 03:55:58,903 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:58,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:58,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:58,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:58,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:58,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:58,909 INFO L82 PathProgramCache]: Analyzing trace with hash 976369992, now seen corresponding path program 1 times [2018-11-10 03:55:58,909 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:58,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:58,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:58,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:58,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:58,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:58,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1009228861, now seen corresponding path program 5 times [2018-11-10 03:55:58,917 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:58,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:58,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:58,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:58,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:58,975 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:55:58,975 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:55:58,975 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:55:58,975 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:55:58,975 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:55:58,975 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:58,975 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:55:58,975 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:55:58,975 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration8_Loop [2018-11-10 03:55:58,975 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:55:58,975 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:55:58,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:58,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:58,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:58,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:59,015 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:55:59,015 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:59,017 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:59,017 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:59,033 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:59,033 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:59,035 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:59,035 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:59,037 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:59,038 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=7} Honda state: {ULTIMATE.start_main_#t~nondet2=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:59,053 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:59,053 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:59,069 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:59,069 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_15=0} Honda state: {v_rep~unnamed0~0~false_15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:59,072 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:59,072 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:59,090 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:55:59,090 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:59,177 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:55:59,178 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:55:59,178 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:55:59,178 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:55:59,178 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:55:59,178 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:55:59,178 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:59,178 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:55:59,178 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:55:59,178 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration8_Loop [2018-11-10 03:55:59,178 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:55:59,178 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:55:59,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:59,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:59,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:59,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-10 03:55:59,230 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:55:59,230 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:55:59,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:59,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:59,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:59,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:59,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:59,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:59,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:59,237 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:59,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-10 03:55:59,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:59,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:59,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:59,238 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 03:55:59,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:59,239 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:55:59,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:59,240 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:59,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:59,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:59,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:59,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:59,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:59,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:59,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:59,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:59,248 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:55:59,252 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:55:59,252 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:55:59,252 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:55:59,252 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:55:59,252 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:55:59,252 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-11-10 03:55:59,253 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:55:59,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:59,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:59,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:55:59,314 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-10 03:55:59,314 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 207 states and 299 transitions. cyclomatic complexity: 110 Second operand 5 states. [2018-11-10 03:55:59,367 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 207 states and 299 transitions. cyclomatic complexity: 110. Second operand 5 states. Result 572 states and 834 transitions. Complement of second has 12 states. [2018-11-10 03:55:59,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 03:55:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 03:55:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2018-11-10 03:55:59,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 15 letters. Loop has 10 letters. [2018-11-10 03:55:59,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:59,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 25 letters. Loop has 10 letters. [2018-11-10 03:55:59,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:59,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 35 transitions. Stem has 15 letters. Loop has 20 letters. [2018-11-10 03:55:59,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:59,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 572 states and 834 transitions. [2018-11-10 03:55:59,378 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 17 [2018-11-10 03:55:59,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 572 states to 451 states and 639 transitions. [2018-11-10 03:55:59,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2018-11-10 03:55:59,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2018-11-10 03:55:59,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 451 states and 639 transitions. [2018-11-10 03:55:59,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:55:59,381 INFO L705 BuchiCegarLoop]: Abstraction has 451 states and 639 transitions. [2018-11-10 03:55:59,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states and 639 transitions. [2018-11-10 03:55:59,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 373. [2018-11-10 03:55:59,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-10 03:55:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 553 transitions. [2018-11-10 03:55:59,394 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 553 transitions. [2018-11-10 03:55:59,394 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 553 transitions. [2018-11-10 03:55:59,395 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 03:55:59,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 553 transitions. [2018-11-10 03:55:59,398 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 03:55:59,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:55:59,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:55:59,399 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-10 03:55:59,399 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:55:59,399 INFO L793 eck$LassoCheckResult]: Stem: 3115#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3105#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 3106#L25-2 assume true; 3240#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 3294#L25 assume !(main_#t~nondet2 != 0);havoc main_#t~nondet2; 3362#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 3376#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 3375#L25-2 assume true; 3374#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 3372#L25 assume main_#t~nondet2 != 0;havoc main_#t~nondet2; 3370#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 3175#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 3173#L25-2 assume true; 3171#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 3165#L25 assume !(main_#t~nondet2 != 0);havoc main_#t~nondet2; 3116#L33 assume !(main_~x~0 < main_~y~0);main_~x~0 := main_~y~0 - 1; 3107#L33-2 [2018-11-10 03:55:59,399 INFO L795 eck$LassoCheckResult]: Loop: 3107#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 3108#L25-2 assume true; 3119#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 3122#L25 assume !(main_#t~nondet2 != 0);havoc main_#t~nondet2; 3431#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 3107#L33-2 [2018-11-10 03:55:59,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:59,400 INFO L82 PathProgramCache]: Analyzing trace with hash 985826727, now seen corresponding path program 6 times [2018-11-10 03:55:59,400 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:59,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:59,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:59,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:59,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:59,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:59,411 INFO L82 PathProgramCache]: Analyzing trace with hash 57449351, now seen corresponding path program 2 times [2018-11-10 03:55:59,411 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:59,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:59,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:59,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:59,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:59,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:59,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1102687649, now seen corresponding path program 2 times [2018-11-10 03:55:59,415 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:59,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:59,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:59,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:59,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:59,451 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:55:59,451 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:55:59,452 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:55:59,452 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:55:59,452 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:55:59,452 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:59,452 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:55:59,452 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:55:59,452 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration9_Loop [2018-11-10 03:55:59,452 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:55:59,452 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:55:59,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:59,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:59,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:59,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:59,491 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:55:59,492 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:59,499 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:59,499 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:59,515 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:59,515 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:59,519 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:59,519 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:59,538 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:55:59,538 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:59,563 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:55:59,563 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:59,582 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:55:59,583 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:55:59,614 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:55:59,615 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:55:59,615 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:55:59,615 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:55:59,615 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:55:59,616 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:55:59,616 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:59,616 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:55:59,616 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:55:59,616 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration9_Loop [2018-11-10 03:55:59,616 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:55:59,616 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:55:59,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:59,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:59,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:59,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:59,739 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:55:59,739 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:55:59,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:59,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:59,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:59,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:59,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:59,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:55:59,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:55:59,742 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:59,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:59,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:59,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:59,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:59,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:59,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:59,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:59,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:59,744 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:55:59,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:55:59,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:55:59,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:55:59,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:55:59,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:55:59,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:55:59,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:55:59,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:55:59,755 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:55:59,756 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:55:59,756 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:55:59,756 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:55:59,757 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:55:59,757 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:55:59,757 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-10 03:55:59,757 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:55:59,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:59,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:59,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:59,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:55:59,791 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 03:55:59,791 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 373 states and 553 transitions. cyclomatic complexity: 211 Second operand 4 states. [2018-11-10 03:55:59,807 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 373 states and 553 transitions. cyclomatic complexity: 211. Second operand 4 states. Result 801 states and 1166 transitions. Complement of second has 7 states. [2018-11-10 03:55:59,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:55:59,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:55:59,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-10 03:55:59,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-10 03:55:59,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:59,809 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:55:59,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:59,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:59,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:59,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:55:59,847 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-10 03:55:59,847 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 373 states and 553 transitions. cyclomatic complexity: 211 Second operand 4 states. [2018-11-10 03:55:59,862 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 373 states and 553 transitions. cyclomatic complexity: 211. Second operand 4 states. Result 822 states and 1197 transitions. Complement of second has 7 states. [2018-11-10 03:55:59,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:55:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:55:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-10 03:55:59,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-10 03:55:59,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:59,866 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:55:59,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:59,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:55:59,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:55:59,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:55:59,890 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-10 03:55:59,890 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 373 states and 553 transitions. cyclomatic complexity: 211 Second operand 4 states. [2018-11-10 03:55:59,901 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 373 states and 553 transitions. cyclomatic complexity: 211. Second operand 4 states. Result 524 states and 754 transitions. Complement of second has 6 states. [2018-11-10 03:55:59,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:55:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:55:59,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-10 03:55:59,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-10 03:55:59,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:59,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 21 letters. Loop has 5 letters. [2018-11-10 03:55:59,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:59,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 16 letters. Loop has 10 letters. [2018-11-10 03:55:59,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:55:59,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 524 states and 754 transitions. [2018-11-10 03:55:59,905 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 03:55:59,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 524 states to 461 states and 667 transitions. [2018-11-10 03:55:59,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-10 03:55:59,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-10 03:55:59,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 461 states and 667 transitions. [2018-11-10 03:55:59,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:55:59,907 INFO L705 BuchiCegarLoop]: Abstraction has 461 states and 667 transitions. [2018-11-10 03:55:59,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states and 667 transitions. [2018-11-10 03:55:59,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 418. [2018-11-10 03:55:59,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-11-10 03:55:59,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 598 transitions. [2018-11-10 03:55:59,913 INFO L728 BuchiCegarLoop]: Abstraction has 418 states and 598 transitions. [2018-11-10 03:55:59,913 INFO L608 BuchiCegarLoop]: Abstraction has 418 states and 598 transitions. [2018-11-10 03:55:59,914 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 03:55:59,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 418 states and 598 transitions. [2018-11-10 03:55:59,915 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 03:55:59,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:55:59,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:55:59,916 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:55:59,916 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:55:59,916 INFO L793 eck$LassoCheckResult]: Stem: 5864#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5855#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 5856#L25-2 assume true; 5953#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 5954#L25 assume !(main_#t~nondet2 != 0);havoc main_#t~nondet2; 6131#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 6234#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 6235#L25-2 assume true; 6228#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 6229#L25 assume main_#t~nondet2 != 0;havoc main_#t~nondet2; 6221#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 6015#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 6013#L25-2 assume true; 6012#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 5916#L25 assume !(main_#t~nondet2 != 0);havoc main_#t~nondet2; 5884#L33 [2018-11-10 03:55:59,916 INFO L795 eck$LassoCheckResult]: Loop: 5884#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 5857#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 5858#L25-2 assume true; 5907#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 5904#L25 assume !(main_#t~nondet2 != 0);havoc main_#t~nondet2; 5884#L33 [2018-11-10 03:55:59,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:59,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1256111864, now seen corresponding path program 1 times [2018-11-10 03:55:59,916 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:59,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:59,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:59,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:59,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:59,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:59,922 INFO L82 PathProgramCache]: Analyzing trace with hash 54493901, now seen corresponding path program 3 times [2018-11-10 03:55:59,922 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:59,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:59,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:59,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:55:59,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:59,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:55:59,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1318812106, now seen corresponding path program 2 times [2018-11-10 03:55:59,925 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:55:59,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:55:59,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:59,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:55:59,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:55:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:55:59,958 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:55:59,958 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:55:59,958 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:55:59,959 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:55:59,959 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:55:59,959 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:55:59,959 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:55:59,959 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:55:59,959 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration10_Loop [2018-11-10 03:55:59,959 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:55:59,959 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:55:59,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:59,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:59,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:55:59,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:00,003 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:56:00,003 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:56:00,010 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:56:00,010 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:56:00,028 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:56:00,028 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:56:00,113 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:56:00,114 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:56:00,114 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:56:00,114 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:56:00,114 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:56:00,114 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:56:00,114 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:56:00,114 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:56:00,114 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:56:00,114 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration10_Loop [2018-11-10 03:56:00,115 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:56:00,115 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:56:00,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:00,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:00,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:00,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:00,152 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:56:00,152 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:56:00,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:00,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:00,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:56:00,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:00,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:00,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:00,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:56:00,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:56:00,156 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:56:00,157 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:56:00,157 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:56:00,157 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:56:00,157 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:56:00,157 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:56:00,158 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-10 03:56:00,158 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:56:00,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:56:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:56:00,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:56:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:56:00,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:56:00,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:56:00,193 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 03:56:00,193 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 418 states and 598 transitions. cyclomatic complexity: 215 Second operand 4 states. [2018-11-10 03:56:00,213 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 418 states and 598 transitions. cyclomatic complexity: 215. Second operand 4 states. Result 577 states and 826 transitions. Complement of second has 7 states. [2018-11-10 03:56:00,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:56:00,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:56:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-10 03:56:00,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-10 03:56:00,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:56:00,214 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:56:00,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:56:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:56:00,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:56:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:56:00,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:56:00,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:56:00,246 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 03:56:00,246 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 418 states and 598 transitions. cyclomatic complexity: 215 Second operand 4 states. [2018-11-10 03:56:00,263 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 418 states and 598 transitions. cyclomatic complexity: 215. Second operand 4 states. Result 580 states and 819 transitions. Complement of second has 7 states. [2018-11-10 03:56:00,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:56:00,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:56:00,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-10 03:56:00,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-10 03:56:00,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:56:00,264 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:56:00,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:56:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:56:00,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:56:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:56:00,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:56:00,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:56:00,297 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 3 loop predicates [2018-11-10 03:56:00,297 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 418 states and 598 transitions. cyclomatic complexity: 215 Second operand 4 states. [2018-11-10 03:56:00,313 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 418 states and 598 transitions. cyclomatic complexity: 215. Second operand 4 states. Result 641 states and 931 transitions. Complement of second has 8 states. [2018-11-10 03:56:00,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:56:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:56:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-10 03:56:00,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 15 letters. Loop has 5 letters. [2018-11-10 03:56:00,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:56:00,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 20 letters. Loop has 5 letters. [2018-11-10 03:56:00,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:56:00,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 15 letters. Loop has 10 letters. [2018-11-10 03:56:00,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:56:00,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 641 states and 931 transitions. [2018-11-10 03:56:00,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 03:56:00,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 641 states to 451 states and 629 transitions. [2018-11-10 03:56:00,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-10 03:56:00,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-10 03:56:00,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 451 states and 629 transitions. [2018-11-10 03:56:00,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 03:56:00,320 INFO L705 BuchiCegarLoop]: Abstraction has 451 states and 629 transitions. [2018-11-10 03:56:00,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states and 629 transitions. [2018-11-10 03:56:00,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 377. [2018-11-10 03:56:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-11-10 03:56:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 533 transitions. [2018-11-10 03:56:00,326 INFO L728 BuchiCegarLoop]: Abstraction has 377 states and 533 transitions. [2018-11-10 03:56:00,326 INFO L608 BuchiCegarLoop]: Abstraction has 377 states and 533 transitions. [2018-11-10 03:56:00,326 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 03:56:00,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 377 states and 533 transitions. [2018-11-10 03:56:00,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 03:56:00,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:56:00,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:56:00,328 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:56:00,328 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 03:56:00,328 INFO L793 eck$LassoCheckResult]: Stem: 8306#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8299#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 8300#L25-2 assume true; 8341#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 8351#L25 assume main_#t~nondet2 != 0;havoc main_#t~nondet2; 8352#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 8407#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 8405#L25-2 assume true; 8404#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 8362#L25 assume !(main_#t~nondet2 != 0);havoc main_#t~nondet2; 8363#L33 assume main_~x~0 < main_~y~0;main_~x~0 := main_~x~0 - 1; 8349#L33-2 main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 8350#L25-2 assume true; 8339#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 8340#L25 assume main_#t~nondet2 != 0;havoc main_#t~nondet2; 8326#L26 assume main_~x~0 < main_~y~0;main_~y~0 := main_~x~0 - 1; 8327#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 8381#L25-2 assume true; 8380#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 8376#L25 assume main_#t~nondet2 != 0;havoc main_#t~nondet2; 8324#L26 [2018-11-10 03:56:00,328 INFO L795 eck$LassoCheckResult]: Loop: 8324#L26 assume !(main_~x~0 < main_~y~0);main_~y~0 := main_~y~0 - 1; 8325#L26-2 main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 8338#L25-2 assume true; 8337#L24-1 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 8332#L25 assume main_#t~nondet2 != 0;havoc main_#t~nondet2; 8324#L26 [2018-11-10 03:56:00,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:56:00,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1453349994, now seen corresponding path program 1 times [2018-11-10 03:56:00,329 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:56:00,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:56:00,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:56:00,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:56:00,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:56:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:56:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:56:00,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:56:00,334 INFO L82 PathProgramCache]: Analyzing trace with hash 47761126, now seen corresponding path program 3 times [2018-11-10 03:56:00,335 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:56:00,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:56:00,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:56:00,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:56:00,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:56:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:56:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:56:00,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:56:00,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2126592995, now seen corresponding path program 2 times [2018-11-10 03:56:00,338 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:56:00,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:56:00,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:56:00,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:56:00,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:56:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:56:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:56:00,375 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:56:00,375 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:56:00,375 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:56:00,375 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:56:00,375 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:56:00,375 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:56:00,375 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:56:00,376 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:56:00,376 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration11_Loop [2018-11-10 03:56:00,376 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:56:00,376 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:56:00,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:00,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:00,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:00,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:00,423 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:56:00,423 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:56:00,425 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:56:00,425 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:56:00,442 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:56:00,442 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_21=0} Honda state: {v_rep~unnamed0~0~false_21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:56:00,445 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:56:00,445 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d3bf629c-cf04-4700-85fe-c55ada192e7c/bin-2019/uautomizer/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:56:00,463 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:56:00,463 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:56:00,545 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:56:00,546 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:56:00,546 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:56:00,546 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:56:00,546 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:56:00,547 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:56:00,547 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:56:00,547 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:56:00,547 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:56:00,547 INFO L131 ssoRankerPreferences]: Filename of dumped script: TelAviv-Amir-Minimum_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration11_Loop [2018-11-10 03:56:00,547 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:56:00,547 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:56:00,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:00,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:00,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:00,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:56:00,594 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:56:00,594 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:56:00,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:00,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:00,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:00,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:00,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:00,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:56:00,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:56:00,596 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:56:00,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:00,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:00,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:00,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:00,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:00,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:56:00,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:56:00,599 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:56:00,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:56:00,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:56:00,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:56:00,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:56:00,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:56:00,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:56:00,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:56:00,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:56:00,601 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 03:56:00,603 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 03:56:00,603 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 03:56:00,603 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 03:56:00,603 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 03:56:00,603 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 03:56:00,603 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2018-11-10 03:56:00,604 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 03:56:00,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:56:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:56:00,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:56:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:56:00,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:56:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:56:00,640 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 03:56:00,640 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 377 states and 533 transitions. cyclomatic complexity: 188 Second operand 4 states. [2018-11-10 03:56:00,654 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 377 states and 533 transitions. cyclomatic complexity: 188. Second operand 4 states. Result 542 states and 756 transitions. Complement of second has 7 states. [2018-11-10 03:56:00,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:56:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:56:00,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2018-11-10 03:56:00,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 20 letters. Loop has 5 letters. [2018-11-10 03:56:00,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:56:00,655 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:56:00,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:56:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:56:00,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:56:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:56:00,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:56:00,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:56:00,678 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 03:56:00,678 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 377 states and 533 transitions. cyclomatic complexity: 188 Second operand 4 states. [2018-11-10 03:56:00,694 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 377 states and 533 transitions. cyclomatic complexity: 188. Second operand 4 states. Result 551 states and 760 transitions. Complement of second has 7 states. [2018-11-10 03:56:00,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:56:00,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:56:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-10 03:56:00,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 20 letters. Loop has 5 letters. [2018-11-10 03:56:00,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:56:00,696 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 03:56:00,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:56:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:56:00,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:56:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:56:00,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:56:00,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:56:00,732 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 3 loop predicates [2018-11-10 03:56:00,733 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 377 states and 533 transitions. cyclomatic complexity: 188 Second operand 4 states. [2018-11-10 03:56:00,749 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 377 states and 533 transitions. cyclomatic complexity: 188. Second operand 4 states. Result 641 states and 935 transitions. Complement of second has 8 states. [2018-11-10 03:56:00,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 03:56:00,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 03:56:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-10 03:56:00,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 20 letters. Loop has 5 letters. [2018-11-10 03:56:00,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:56:00,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 25 letters. Loop has 5 letters. [2018-11-10 03:56:00,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:56:00,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 20 letters. Loop has 10 letters. [2018-11-10 03:56:00,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 03:56:00,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 641 states and 935 transitions. [2018-11-10 03:56:00,758 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:56:00,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 641 states to 0 states and 0 transitions. [2018-11-10 03:56:00,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 03:56:00,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 03:56:00,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 03:56:00,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:56:00,759 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:56:00,759 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:56:00,759 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:56:00,759 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 03:56:00,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:56:00,759 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:56:00,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 03:56:00,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 03:56:00 BoogieIcfgContainer [2018-11-10 03:56:00,765 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 03:56:00,765 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:56:00,765 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:56:00,765 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:56:00,766 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:55:55" (3/4) ... [2018-11-10 03:56:00,769 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 03:56:00,769 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:56:00,770 INFO L168 Benchmark]: Toolchain (without parser) took 5848.62 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 339.7 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -149.2 MB). Peak memory consumption was 190.5 MB. Max. memory is 11.5 GB. [2018-11-10 03:56:00,771 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-10 03:56:00,771 INFO L168 Benchmark]: CACSL2BoogieTranslator took 126.99 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:56:00,772 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.27 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:56:00,772 INFO L168 Benchmark]: Boogie Preprocessor took 12.69 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:56:00,772 INFO L168 Benchmark]: RCFGBuilder took 183.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -199.3 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2018-11-10 03:56:00,773 INFO L168 Benchmark]: BuchiAutomizer took 5493.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.3 MB). Peak memory consumption was 218.4 MB. Max. memory is 11.5 GB. [2018-11-10 03:56:00,773 INFO L168 Benchmark]: Witness Printer took 4.35 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:56:00,775 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 126.99 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.27 ms. Allocated memory is still 1.0 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.69 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 183.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -199.3 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5493.66 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.3 MB). Peak memory consumption was 218.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.35 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (0 trivial, 7 deterministic, 4 nondeterministic). One deterministic module has affine ranking function y and consists of 5 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function x and consists of 7 locations. One deterministic module has affine ranking function y and consists of 7 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. One nondeterministic module has affine ranking function x and consists of 4 locations. One nondeterministic module has affine ranking function x and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 12 iterations. TraceHistogramMax:4. Analysis of lassos took 4.0s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 344 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 418 states and ocurred in iteration 9. Nontrivial modules had stage [7, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/6 HoareTripleCheckerStatistics: 284 SDtfs, 364 SDslu, 137 SDs, 0 SdLazy, 279 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT11 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital22 mio100 ax153 hnf98 lsp54 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq154 hnf92 smp100 dnf100 smp100 tf107 neg100 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 24 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 11 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...