./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8152c66d-b4e1-461b-ac2b-27d12298d448/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8152c66d-b4e1-461b-ac2b-27d12298d448/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8152c66d-b4e1-461b-ac2b-27d12298d448/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8152c66d-b4e1-461b-ac2b-27d12298d448/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8152c66d-b4e1-461b-ac2b-27d12298d448/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8152c66d-b4e1-461b-ac2b-27d12298d448/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 18b42b65120149c30866fbc5b5479df029781f63 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 02:41:19,662 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 02:41:19,664 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 02:41:19,673 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 02:41:19,674 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 02:41:19,674 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 02:41:19,675 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 02:41:19,677 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 02:41:19,678 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 02:41:19,678 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 02:41:19,679 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 02:41:19,679 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 02:41:19,680 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 02:41:19,681 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 02:41:19,681 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 02:41:19,682 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 02:41:19,683 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 02:41:19,684 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 02:41:19,685 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 02:41:19,686 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 02:41:19,687 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 02:41:19,688 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 02:41:19,689 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 02:41:19,690 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 02:41:19,690 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 02:41:19,690 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 02:41:19,691 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 02:41:19,692 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 02:41:19,692 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 02:41:19,693 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 02:41:19,693 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 02:41:19,694 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 02:41:19,694 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 02:41:19,694 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 02:41:19,695 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 02:41:19,695 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 02:41:19,695 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8152c66d-b4e1-461b-ac2b-27d12298d448/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 02:41:19,706 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 02:41:19,706 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 02:41:19,707 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 02:41:19,707 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 02:41:19,708 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 02:41:19,708 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 02:41:19,708 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 02:41:19,708 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 02:41:19,708 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 02:41:19,708 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 02:41:19,708 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 02:41:19,708 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 02:41:19,709 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 02:41:19,709 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 02:41:19,709 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 02:41:19,709 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 02:41:19,709 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 02:41:19,709 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 02:41:19,709 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 02:41:19,710 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 02:41:19,710 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 02:41:19,710 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 02:41:19,710 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 02:41:19,710 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 02:41:19,710 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 02:41:19,710 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 02:41:19,711 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 02:41:19,711 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 02:41:19,711 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_8152c66d-b4e1-461b-ac2b-27d12298d448/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 -> 18b42b65120149c30866fbc5b5479df029781f63 [2018-11-10 02:41:19,735 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 02:41:19,744 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 02:41:19,746 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 02:41:19,747 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 02:41:19,747 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 02:41:19,748 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8152c66d-b4e1-461b-ac2b-27d12298d448/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i [2018-11-10 02:41:19,786 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8152c66d-b4e1-461b-ac2b-27d12298d448/bin-2019/uautomizer/data/e5a76586d/684aada196194774b96b44aaef12eff7/FLAG060995689 [2018-11-10 02:41:20,203 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 02:41:20,204 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8152c66d-b4e1-461b-ac2b-27d12298d448/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i [2018-11-10 02:41:20,208 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8152c66d-b4e1-461b-ac2b-27d12298d448/bin-2019/uautomizer/data/e5a76586d/684aada196194774b96b44aaef12eff7/FLAG060995689 [2018-11-10 02:41:20,221 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8152c66d-b4e1-461b-ac2b-27d12298d448/bin-2019/uautomizer/data/e5a76586d/684aada196194774b96b44aaef12eff7 [2018-11-10 02:41:20,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 02:41:20,224 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 02:41:20,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 02:41:20,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 02:41:20,228 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 02:41:20,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:41:20" (1/1) ... [2018-11-10 02:41:20,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e983fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:20, skipping insertion in model container [2018-11-10 02:41:20,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:41:20" (1/1) ... [2018-11-10 02:41:20,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 02:41:20,249 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 02:41:20,352 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:41:20,360 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 02:41:20,371 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:41:20,381 INFO L193 MainTranslator]: Completed translation [2018-11-10 02:41:20,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:20 WrapperNode [2018-11-10 02:41:20,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 02:41:20,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 02:41:20,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 02:41:20,382 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 02:41:20,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:20" (1/1) ... [2018-11-10 02:41:20,394 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:20" (1/1) ... [2018-11-10 02:41:20,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 02:41:20,408 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 02:41:20,408 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 02:41:20,408 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 02:41:20,415 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:20" (1/1) ... [2018-11-10 02:41:20,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:20" (1/1) ... [2018-11-10 02:41:20,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:20" (1/1) ... [2018-11-10 02:41:20,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:20" (1/1) ... [2018-11-10 02:41:20,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:20" (1/1) ... [2018-11-10 02:41:20,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:20" (1/1) ... [2018-11-10 02:41:20,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:20" (1/1) ... [2018-11-10 02:41:20,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 02:41:20,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 02:41:20,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 02:41:20,424 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 02:41:20,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8152c66d-b4e1-461b-ac2b-27d12298d448/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 02:41:20,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 02:41:20,516 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-11-10 02:41:20,516 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-11-10 02:41:20,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 02:41:20,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 02:41:20,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 02:41:20,727 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 02:41:20,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:41:20 BoogieIcfgContainer [2018-11-10 02:41:20,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 02:41:20,728 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 02:41:20,728 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 02:41:20,730 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 02:41:20,731 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:41:20,731 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 02:41:20" (1/3) ... [2018-11-10 02:41:20,732 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@155278da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:41:20, skipping insertion in model container [2018-11-10 02:41:20,732 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:41:20,732 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:20" (2/3) ... [2018-11-10 02:41:20,732 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@155278da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:41:20, skipping insertion in model container [2018-11-10 02:41:20,732 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:41:20,733 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:41:20" (3/3) ... [2018-11-10 02:41:20,734 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11B_true-termination.c.i [2018-11-10 02:41:20,771 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 02:41:20,771 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 02:41:20,771 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 02:41:20,771 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 02:41:20,771 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 02:41:20,771 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 02:41:20,772 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 02:41:20,772 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 02:41:20,772 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 02:41:20,781 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-10 02:41:20,802 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-10 02:41:20,803 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:41:20,803 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:41:20,808 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 02:41:20,809 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:41:20,809 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 02:41:20,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-10 02:41:20,810 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-10 02:41:20,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:41:20,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:41:20,811 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 02:41:20,811 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:41:20,816 INFO L793 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 10#L26true SUMMARY for call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L26 32#L26-1true havoc main_#t~nondet7; 29#L28-4true [2018-11-10 02:41:20,817 INFO L795 eck$LassoCheckResult]: Loop: 29#L28-4true assume true; 14#L28-1true SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L28-1 11#L28-2true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 17#L30true SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L30 15#L30-1true havoc main_#t~nondet10; 25#L33true SUMMARY for call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L33 23#L33-1true call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 13#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset; 6#L9true SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 7#L9-1true assume #t~mem1 < 0;havoc #t~mem1; 31#L10true SUMMARY for call #t~mem2 := read~int(~op.base, ~op.offset, 4); srcloc: L10 20#L10-1true ~r~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~op.base, ~op.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~r~0; 28#recFINALtrue assume true; 26#recEXITtrue >#52#return; 19#L33-2true assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 4#L33-4true SUMMARY for call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L33-4 3#L33-5true havoc main_#t~mem13;havoc main_#t~ite12;havoc main_#t~ret11; 29#L28-4true [2018-11-10 02:41:20,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:41:20,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1356516, now seen corresponding path program 1 times [2018-11-10 02:41:20,824 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:41:20,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:41:20,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:20,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:41:20,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:20,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:41:20,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1202142856, now seen corresponding path program 1 times [2018-11-10 02:41:20,909 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:41:20,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:41:20,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:20,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:41:20,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:20,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:41:20,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1364701691, now seen corresponding path program 1 times [2018-11-10 02:41:20,958 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:41:20,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:41:20,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:20,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:41:20,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:21,488 WARN L179 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 105 [2018-11-10 02:41:21,638 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:41:21,639 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:41:21,640 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:41:21,640 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:41:21,640 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:41:21,640 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:41:21,640 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:41:21,640 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:41:21,640 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B_true-termination.c.i_Iteration1_Lasso [2018-11-10 02:41:21,640 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:41:21,641 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:41:21,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 02:41:21,663 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 02:41:21,665 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 02:41:21,834 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 02:41:21,835 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 02:41:21,836 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 02:41:21,838 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 02:41:21,839 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 02:41:21,842 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 02:41:21,844 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 02:41:22,102 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:41:22,106 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:41:22,108 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 02:41:22,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:22,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:22,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:22,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:22,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:22,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:22,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:22,113 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:22,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:41:22,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:22,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:22,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:22,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:22,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:22,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:22,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:22,116 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:22,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:41:22,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:22,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:22,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:22,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:22,119 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:41:22,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:41:22,137 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:41:22,145 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 02:41:22,145 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 02:41:22,147 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:41:22,149 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 02:41:22,149 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:41:22,149 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2018-11-10 02:41:22,165 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-10 02:41:22,171 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 02:41:22,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:41:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:41:22,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:41:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:41:22,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:41:22,257 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:41:22,261 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:41:22,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 02:41:22,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 02:41:22,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:41:22,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-11-10 02:41:22,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-10 02:41:22,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 02:41:22,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:41:22,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:41:22,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:41:22,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-11-10 02:41:22,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 02:41:22,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-10 02:41:22,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:41:22,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:41:22,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:41:22,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2018-11-10 02:41:22,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 02:41:22,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 02:41:22,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:41:22,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:41:22,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 02:41:22,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-11-10 02:41:22,400 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 02:41:22,410 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2018-11-10 02:41:22,411 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 10 states. [2018-11-10 02:41:22,550 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states.. Second operand 10 states. Result 115 states and 128 transitions. Complement of second has 20 states. [2018-11-10 02:41:22,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-10 02:41:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 02:41:22,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2018-11-10 02:41:22,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 4 letters. Loop has 17 letters. [2018-11-10 02:41:22,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:41:22,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 21 letters. Loop has 17 letters. [2018-11-10 02:41:22,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:41:22,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 4 letters. Loop has 34 letters. [2018-11-10 02:41:22,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:41:22,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 128 transitions. [2018-11-10 02:41:22,564 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2018-11-10 02:41:22,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 96 states and 107 transitions. [2018-11-10 02:41:22,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-11-10 02:41:22,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2018-11-10 02:41:22,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 107 transitions. [2018-11-10 02:41:22,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:41:22,573 INFO L705 BuchiCegarLoop]: Abstraction has 96 states and 107 transitions. [2018-11-10 02:41:22,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 107 transitions. [2018-11-10 02:41:22,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2018-11-10 02:41:22,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-10 02:41:22,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2018-11-10 02:41:22,596 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2018-11-10 02:41:22,596 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2018-11-10 02:41:22,597 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 02:41:22,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 104 transitions. [2018-11-10 02:41:22,598 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 24 [2018-11-10 02:41:22,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:41:22,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:41:22,598 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:41:22,598 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:41:22,599 INFO L793 eck$LassoCheckResult]: Stem: 319#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 282#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 283#L26 SUMMARY for call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L26 297#L26-1 havoc main_#t~nondet7; 326#L28-4 assume true; 300#L28-1 SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L28-1 293#L28-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 294#L30 SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L30 302#L30-1 havoc main_#t~nondet10; 303#L33 SUMMARY for call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L33 307#L33-1 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 318#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 360#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 358#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset; 306#L16 SUMMARY for call #t~mem4 := read~int(~op.base, ~op.offset, 4); srcloc: L16 308#L16-1 SUMMARY for call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4); srcloc: L16-1 310#L16-2 havoc #t~mem4;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~op.base, ~op.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true; 277#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 298#recENTRY [2018-11-10 02:41:22,599 INFO L795 eck$LassoCheckResult]: Loop: 298#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 275#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 278#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset; 285#L16 SUMMARY for call #t~mem4 := read~int(~op.base, ~op.offset, 4); srcloc: L16 359#L16-1 SUMMARY for call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4); srcloc: L16-1 291#L16-2 havoc #t~mem4;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~op.base, ~op.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true; 276#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 298#recENTRY [2018-11-10 02:41:22,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:41:22,599 INFO L82 PathProgramCache]: Analyzing trace with hash -854706013, now seen corresponding path program 1 times [2018-11-10 02:41:22,599 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:41:22,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:41:22,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:22,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:41:22,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:22,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:41:22,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1778151469, now seen corresponding path program 1 times [2018-11-10 02:41:22,636 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:41:22,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:41:22,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:22,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:41:22,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:22,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:41:22,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1870503243, now seen corresponding path program 2 times [2018-11-10 02:41:22,654 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:41:22,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:41:22,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:22,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:41:22,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:22,818 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2018-11-10 02:41:23,072 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2018-11-10 02:41:23,351 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 102 [2018-11-10 02:41:23,640 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 113 [2018-11-10 02:41:23,697 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:41:23,697 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:41:23,698 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:41:23,698 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:41:23,698 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:41:23,698 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:41:23,698 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:41:23,698 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:41:23,698 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B_true-termination.c.i_Iteration2_Lasso [2018-11-10 02:41:23,698 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:41:23,698 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:41:23,702 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 02:41:23,705 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 02:41:23,706 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 02:41:23,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 02:41:23,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 02:41:23,710 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 02:41:23,711 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 02:41:23,712 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 02:41:23,714 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 02:41:23,715 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 02:41:23,716 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 02:41:23,717 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 02:41:23,718 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 02:41:23,719 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 02:41:23,720 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 02:41:23,722 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 02:41:23,723 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 02:41:23,724 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 02:41:23,725 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 02:41:23,726 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 02:41:23,727 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 02:41:23,728 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 02:41:23,729 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 02:41:23,730 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 02:41:23,731 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 02:41:23,732 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 02:41:23,733 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 02:41:23,734 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 02:41:23,735 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 02:41:23,736 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 02:41:23,816 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 02:41:23,817 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 02:41:23,819 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 02:41:23,820 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 02:41:23,822 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 02:41:23,823 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 02:41:23,824 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 02:41:23,826 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 02:41:23,827 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 02:41:23,829 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 02:41:23,830 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 02:41:23,831 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 02:41:23,833 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 02:41:23,834 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 02:41:23,836 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 02:41:23,837 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 02:41:23,838 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 02:41:23,839 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 02:41:23,841 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 02:41:24,009 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:41:24,009 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:41:24,010 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 02:41:24,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,011 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 02:41:24,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,013 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 02:41:24,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,014 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,014 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,015 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,015 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 02:41:24,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,017 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 02:41:24,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,019 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,019 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 02:41:24,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,021 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:41:24,021 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:41:24,023 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,023 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 02:41:24,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,024 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,024 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 02:41:24,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,026 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 02:41:24,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,027 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,028 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 02:41:24,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,029 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,030 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 02:41:24,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,032 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,032 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 02:41:24,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,034 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,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 02:41:24,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,036 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 02:41:24,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,038 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,038 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 02:41:24,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,040 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,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 02:41:24,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,042 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,042 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 02:41:24,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,043 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,043 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 02:41:24,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,045 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,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 02:41:24,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,046 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,046 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 02:41:24,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,048 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,048 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 02:41:24,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,050 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,050 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 02:41:24,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,052 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,052 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 02:41:24,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,054 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,054 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 02:41:24,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,056 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,056 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 02:41:24,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:24,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:24,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:24,058 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,058 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 02:41:24,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,059 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,060 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:41:24,060 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:41:24,068 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:24,068 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 02:41:24,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:24,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:24,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:24,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:24,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:41:24,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:41:24,079 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:41:24,083 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 02:41:24,083 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 02:41:24,084 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:41:24,084 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 02:41:24,085 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:41:24,085 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2018-11-10 02:41:24,094 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-10 02:41:24,096 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 02:41:24,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:41:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:41:24,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:41:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:41:24,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:41:24,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 47 [2018-11-10 02:41:24,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-11-10 02:41:24,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:41:24,234 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:41:24,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 43 [2018-11-10 02:41:24,241 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 02:41:24,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 02:41:24,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 02:41:24,273 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:53 [2018-11-10 02:41:24,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 02:41:24,297 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 02:41:24,298 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 93 states and 104 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-11-10 02:41:24,440 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 93 states and 104 transitions. cyclomatic complexity: 16. Second operand 7 states. Result 280 states and 317 transitions. Complement of second has 25 states. [2018-11-10 02:41:24,441 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 02:41:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-10 02:41:24,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2018-11-10 02:41:24,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 18 letters. Loop has 7 letters. [2018-11-10 02:41:24,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:41:24,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 25 letters. Loop has 7 letters. [2018-11-10 02:41:24,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:41:24,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 18 letters. Loop has 14 letters. [2018-11-10 02:41:24,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:41:24,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 280 states and 317 transitions. [2018-11-10 02:41:24,448 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2018-11-10 02:41:24,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 280 states to 232 states and 269 transitions. [2018-11-10 02:41:24,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2018-11-10 02:41:24,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2018-11-10 02:41:24,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 232 states and 269 transitions. [2018-11-10 02:41:24,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:41:24,453 INFO L705 BuchiCegarLoop]: Abstraction has 232 states and 269 transitions. [2018-11-10 02:41:24,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states and 269 transitions. [2018-11-10 02:41:24,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 214. [2018-11-10 02:41:24,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-10 02:41:24,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 245 transitions. [2018-11-10 02:41:24,467 INFO L728 BuchiCegarLoop]: Abstraction has 214 states and 245 transitions. [2018-11-10 02:41:24,467 INFO L608 BuchiCegarLoop]: Abstraction has 214 states and 245 transitions. [2018-11-10 02:41:24,467 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 02:41:24,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 245 transitions. [2018-11-10 02:41:24,470 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 34 [2018-11-10 02:41:24,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:41:24,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:41:24,471 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:41:24,471 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:41:24,471 INFO L793 eck$LassoCheckResult]: Stem: 826#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 787#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 788#L26 SUMMARY for call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L26 801#L26-1 havoc main_#t~nondet7; 839#L28-4 assume true; 840#L28-1 SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L28-1 956#L28-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 955#L30 SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L30 954#L30-1 havoc main_#t~nondet10; 953#L33 SUMMARY for call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L33 895#L33-1 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 952#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 965#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 963#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 962#L10 SUMMARY for call #t~mem2 := read~int(~op.base, ~op.offset, 4); srcloc: L10 960#L10-1 ~r~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~op.base, ~op.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~r~0; 913#recFINAL assume true; 894#recEXIT >#52#return; 896#L33-2 assume !(main_#t~ret11 <= -1);main_#t~ite12 := 1; 935#L33-4 [2018-11-10 02:41:24,471 INFO L795 eck$LassoCheckResult]: Loop: 935#L33-4 SUMMARY for call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L33-4 933#L33-5 havoc main_#t~mem13;havoc main_#t~ite12;havoc main_#t~ret11; 932#L28-4 assume true; 931#L28-1 SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L28-1 929#L28-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 927#L30 SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L30 925#L30-1 havoc main_#t~nondet10; 923#L33 SUMMARY for call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L33 901#L33-1 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 921#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 966#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 949#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 950#L10 SUMMARY for call #t~mem2 := read~int(~op.base, ~op.offset, 4); srcloc: L10 914#L10-1 ~r~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~op.base, ~op.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~r~0; 915#recFINAL assume true; 900#recEXIT >#52#return; 902#L33-2 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 935#L33-4 [2018-11-10 02:41:24,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:41:24,472 INFO L82 PathProgramCache]: Analyzing trace with hash -814827002, now seen corresponding path program 1 times [2018-11-10 02:41:24,472 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:41:24,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:41:24,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:24,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:41:24,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:41:24,554 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 02:41:24,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:41:24,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 02:41:24,557 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:41:24,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:41:24,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1488114586, now seen corresponding path program 2 times [2018-11-10 02:41:24,557 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:41:24,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:41:24,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:24,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:41:24,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:24,835 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 108 [2018-11-10 02:41:24,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 02:41:24,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 02:41:24,875 INFO L87 Difference]: Start difference. First operand 214 states and 245 transitions. cyclomatic complexity: 41 Second operand 7 states. [2018-11-10 02:41:24,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:41:24,925 INFO L93 Difference]: Finished difference Result 188 states and 213 transitions. [2018-11-10 02:41:24,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 02:41:24,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 213 transitions. [2018-11-10 02:41:24,927 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 [2018-11-10 02:41:24,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 178 states and 203 transitions. [2018-11-10 02:41:24,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2018-11-10 02:41:24,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2018-11-10 02:41:24,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 203 transitions. [2018-11-10 02:41:24,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:41:24,930 INFO L705 BuchiCegarLoop]: Abstraction has 178 states and 203 transitions. [2018-11-10 02:41:24,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 203 transitions. [2018-11-10 02:41:24,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2018-11-10 02:41:24,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-10 02:41:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 200 transitions. [2018-11-10 02:41:24,940 INFO L728 BuchiCegarLoop]: Abstraction has 175 states and 200 transitions. [2018-11-10 02:41:24,940 INFO L608 BuchiCegarLoop]: Abstraction has 175 states and 200 transitions. [2018-11-10 02:41:24,940 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 02:41:24,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 200 transitions. [2018-11-10 02:41:24,943 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-11-10 02:41:24,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:41:24,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:41:24,944 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:41:24,945 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:41:24,945 INFO L793 eck$LassoCheckResult]: Stem: 1246#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1204#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1205#L26 SUMMARY for call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L26 1218#L26-1 havoc main_#t~nondet7; 1260#L28-4 assume true; 1258#L28-1 SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L28-1 1302#L28-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 1301#L30 SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L30 1300#L30-1 havoc main_#t~nondet10; 1299#L33 SUMMARY for call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L33 1271#L33-1 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 1297#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 1295#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 1294#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset; 1293#L16 SUMMARY for call #t~mem4 := read~int(~op.base, ~op.offset, 4); srcloc: L16 1292#L16-1 SUMMARY for call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4); srcloc: L16-1 1291#L16-2 havoc #t~mem4;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~op.base, ~op.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true; 1240#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 1288#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 1289#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 1321#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 1316#L10 SUMMARY for call #t~mem2 := read~int(~op.base, ~op.offset, 4); srcloc: L10 1312#L10-1 ~r~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~op.base, ~op.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~r~0; 1309#recFINAL assume true; 1304#recEXIT >#50#return; 1274#L19-1 #res := #t~ret5;havoc #t~ret5; 1273#recFINAL assume true; 1270#recEXIT >#52#return; 1238#L33-2 assume !(main_#t~ret11 <= -1);main_#t~ite12 := 1; 1195#L33-4 [2018-11-10 02:41:24,945 INFO L795 eck$LassoCheckResult]: Loop: 1195#L33-4 SUMMARY for call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L33-4 1190#L33-5 havoc main_#t~mem13;havoc main_#t~ite12;havoc main_#t~ret11; 1191#L28-4 assume true; 1272#L28-1 SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L28-1 1269#L28-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 1268#L30 SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L30 1267#L30-1 havoc main_#t~nondet10; 1251#L33 SUMMARY for call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L33 1252#L33-1 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 1266#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 1290#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 1286#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 1287#L10 SUMMARY for call #t~mem2 := read~int(~op.base, ~op.offset, 4); srcloc: L10 1298#L10-1 ~r~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~op.base, ~op.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~r~0; 1296#recFINAL assume true; 1276#recEXIT >#52#return; 1261#L33-2 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 1195#L33-4 [2018-11-10 02:41:24,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:41:24,945 INFO L82 PathProgramCache]: Analyzing trace with hash -2087270535, now seen corresponding path program 1 times [2018-11-10 02:41:24,945 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:41:24,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:41:24,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:24,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:41:24,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:41:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 02:41:25,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:41:25,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 02:41:25,006 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 02:41:25,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:41:25,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1488114586, now seen corresponding path program 3 times [2018-11-10 02:41:25,006 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:41:25,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:41:25,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:25,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:41:25,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:25,303 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 108 [2018-11-10 02:41:25,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 02:41:25,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 02:41:25,343 INFO L87 Difference]: Start difference. First operand 175 states and 200 transitions. cyclomatic complexity: 33 Second operand 8 states. [2018-11-10 02:41:25,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:41:25,388 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2018-11-10 02:41:25,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 02:41:25,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 170 transitions. [2018-11-10 02:41:25,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 02:41:25,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 105 states and 116 transitions. [2018-11-10 02:41:25,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-10 02:41:25,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-10 02:41:25,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 116 transitions. [2018-11-10 02:41:25,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 02:41:25,391 INFO L705 BuchiCegarLoop]: Abstraction has 105 states and 116 transitions. [2018-11-10 02:41:25,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 116 transitions. [2018-11-10 02:41:25,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2018-11-10 02:41:25,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-10 02:41:25,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2018-11-10 02:41:25,395 INFO L728 BuchiCegarLoop]: Abstraction has 98 states and 109 transitions. [2018-11-10 02:41:25,395 INFO L608 BuchiCegarLoop]: Abstraction has 98 states and 109 transitions. [2018-11-10 02:41:25,396 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 02:41:25,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 109 transitions. [2018-11-10 02:41:25,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-10 02:41:25,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:41:25,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:41:25,398 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:41:25,398 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:41:25,398 INFO L793 eck$LassoCheckResult]: Stem: 1569#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1533#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 1534#L26 SUMMARY for call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L26 1545#L26-1 havoc main_#t~nondet7; 1575#L28-4 assume true; 1556#L28-1 SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L28-1 1548#L28-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 1549#L30 SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L30 1559#L30-1 havoc main_#t~nondet10; 1560#L33 SUMMARY for call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L33 1540#L33-1 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 1554#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 1539#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 1541#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset; 1544#L16 SUMMARY for call #t~mem4 := read~int(~op.base, ~op.offset, 4); srcloc: L16 1562#L16-1 SUMMARY for call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4); srcloc: L16-1 1551#L16-2 havoc #t~mem4;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~op.base, ~op.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true; 1552#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 1590#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 1602#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 1601#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 1599#L10 SUMMARY for call #t~mem2 := read~int(~op.base, ~op.offset, 4); srcloc: L10 1598#L10-1 ~r~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~op.base, ~op.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~r~0; 1596#recFINAL assume true; 1588#recEXIT >#50#return; 1584#L19-1 #res := #t~ret5;havoc #t~ret5; 1585#recFINAL assume true; 1600#recEXIT >#52#return; 1580#L33-2 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 1579#L33-4 SUMMARY for call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L33-4 1577#L33-5 havoc main_#t~mem13;havoc main_#t~ite12;havoc main_#t~ret11; 1576#L28-4 assume true; 1555#L28-1 SUMMARY for call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L28-1 1546#L28-2 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset; 1547#L30 SUMMARY for call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4); srcloc: L30 1557#L30-1 havoc main_#t~nondet10; 1558#L33 SUMMARY for call main_#t~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); srcloc: L33 1536#L33-1 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 1553#recENTRY [2018-11-10 02:41:25,398 INFO L795 eck$LassoCheckResult]: Loop: 1553#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset; 1535#L9 SUMMARY for call #t~mem1 := read~int(~op.base, ~op.offset, 4); srcloc: L9 1537#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset; 1542#L16 SUMMARY for call #t~mem4 := read~int(~op.base, ~op.offset, 4); srcloc: L16 1561#L16-1 SUMMARY for call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4); srcloc: L16-1 1550#L16-2 havoc #t~mem4;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~op.base, ~op.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true; 1538#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 1553#recENTRY [2018-11-10 02:41:25,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:41:25,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1315070455, now seen corresponding path program 1 times [2018-11-10 02:41:25,398 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:41:25,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:41:25,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:25,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:41:25,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:25,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:41:25,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1778151469, now seen corresponding path program 2 times [2018-11-10 02:41:25,428 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:41:25,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:41:25,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:25,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:41:25,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:25,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:41:25,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1380184713, now seen corresponding path program 2 times [2018-11-10 02:41:25,438 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:41:25,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:41:25,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:25,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:41:25,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:41:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:41:25,616 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2018-11-10 02:41:26,123 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 111 [2018-11-10 02:41:27,411 WARN L179 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 256 DAG size of output: 223 [2018-11-10 02:41:27,571 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-11-10 02:41:27,772 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-11-10 02:41:27,872 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:41:27,873 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:41:27,873 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:41:27,873 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:41:27,873 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:41:27,873 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:41:27,873 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:41:27,873 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:41:27,873 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B_true-termination.c.i_Iteration5_Lasso [2018-11-10 02:41:27,873 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:41:27,873 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:41:27,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 02:41:27,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 02:41:27,882 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 02:41:27,883 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 02:41:27,884 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 02:41:27,885 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 02:41:27,887 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 02:41:27,888 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 02:41:27,889 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 02:41:27,890 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 02:41:27,892 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 02:41:27,893 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 02:41:27,895 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 02:41:27,896 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 02:41:27,897 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 02:41:27,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:41:27,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:41:27,906 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 02:41:27,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 02:41:27,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:41:27,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:41:27,916 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 02:41:27,918 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 02:41:27,919 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 02:41:27,920 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 02:41:27,921 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 02:41:27,923 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 02:41:27,926 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 02:41:27,928 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 02:41:27,930 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 02:41:27,932 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 02:41:27,937 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 02:41:27,939 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 02:41:28,059 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 02:41:28,060 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 02:41:28,060 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 02:41:28,061 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 02:41:28,063 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 02:41:28,064 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 02:41:28,065 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 02:41:28,066 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 02:41:28,067 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 02:41:28,068 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 02:41:28,068 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 02:41:28,069 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 02:41:28,070 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 02:41:28,071 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 02:41:28,072 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 02:41:28,073 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 02:41:28,231 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:41:28,232 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:41:28,232 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 02:41:28,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,233 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:41:28,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,235 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,235 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 02:41:28,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,236 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,237 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 02:41:28,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,238 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:41:28,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,240 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,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 02:41:28,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:41:28,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:41:28,242 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,242 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 02:41:28,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,243 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:41:28,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,244 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,244 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 02:41:28,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,245 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,245 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 02:41:28,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,246 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,247 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 02:41:28,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,247 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:41:28,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,249 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,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 02:41:28,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,250 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,250 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 02:41:28,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,251 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,252 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 02:41:28,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,253 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,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 02:41:28,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,255 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:41:28,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,257 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,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 02:41:28,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,258 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,259 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 02:41:28,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,260 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,260 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 02:41:28,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,262 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,262 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 02:41:28,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,263 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,264 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 02:41:28,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,265 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,265 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 02:41:28,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,267 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,267 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 02:41:28,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:41:28,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:41:28,269 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,270 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 02:41:28,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,272 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 02:41:28,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:41:28,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:41:28,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:41:28,273 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,273 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 02:41:28,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:41:28,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:41:28,279 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,279 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 02:41:28,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:41:28,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:41:28,283 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,283 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 02:41:28,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,284 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:41:28,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,285 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:41:28,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:41:28,286 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,287 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 02:41:28,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:41:28,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:41:28,289 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,289 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 02:41:28,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,290 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:41:28,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,290 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:41:28,290 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:41:28,292 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,292 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 02:41:28,292 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,293 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:41:28,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,293 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:41:28,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:41:28,295 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,295 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 02:41:28,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,295 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 02:41:28,296 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:41:28,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,297 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-10 02:41:28,297 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 02:41:28,303 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,303 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 02:41:28,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:41:28,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:41:28,310 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:41:28,311 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 02:41:28,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:41:28,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:41:28,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:41:28,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:41:28,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:41:28,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 02:41:28,317 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 02:41:28,319 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 02:41:28,320 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 02:41:28,320 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 02:41:28,320 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 02:41:28,321 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 02:41:28,321 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2018-11-10 02:41:28,365 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-10 02:41:28,370 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 02:41:28,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:41:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:41:28,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:41:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:41:28,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:41:28,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 47 [2018-11-10 02:41:28,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-11-10 02:41:28,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:41:28,535 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:41:28,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 43 [2018-11-10 02:41:28,541 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 02:41:28,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 02:41:28,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 02:41:28,569 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:53 [2018-11-10 02:41:28,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 02:41:28,589 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-10 02:41:28,589 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 98 states and 109 transitions. cyclomatic complexity: 16 Second operand 8 states. [2018-11-10 02:41:28,743 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 98 states and 109 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 163 states and 181 transitions. Complement of second has 24 states. [2018-11-10 02:41:28,745 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 02:41:28,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 02:41:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-10 02:41:28,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 38 letters. Loop has 7 letters. [2018-11-10 02:41:28,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:41:28,746 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:41:28,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:41:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:41:28,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:41:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:41:28,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:41:28,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 47 [2018-11-10 02:41:28,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-11-10 02:41:28,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:41:28,887 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:41:28,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 43 [2018-11-10 02:41:28,900 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 02:41:28,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 02:41:28,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 02:41:28,928 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:53 [2018-11-10 02:41:28,947 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 02:41:28,947 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-10 02:41:28,947 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 98 states and 109 transitions. cyclomatic complexity: 16 Second operand 8 states. [2018-11-10 02:41:29,079 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 98 states and 109 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 163 states and 181 transitions. Complement of second has 24 states. [2018-11-10 02:41:29,079 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 02:41:29,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 02:41:29,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-10 02:41:29,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 38 letters. Loop has 7 letters. [2018-11-10 02:41:29,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:41:29,080 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 02:41:29,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:41:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:41:29,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:41:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:41:29,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 02:41:29,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 47 [2018-11-10 02:41:29,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-11-10 02:41:29,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 02:41:29,220 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 02:41:29,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 43 [2018-11-10 02:41:29,226 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 02:41:29,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 02:41:29,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-10 02:41:29,255 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:39, output treesize:53 [2018-11-10 02:41:29,272 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 02:41:29,273 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-10 02:41:29,273 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 98 states and 109 transitions. cyclomatic complexity: 16 Second operand 8 states. [2018-11-10 02:41:29,420 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 98 states and 109 transitions. cyclomatic complexity: 16. Second operand 8 states. Result 165 states and 177 transitions. Complement of second has 25 states. [2018-11-10 02:41:29,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 02:41:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 02:41:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2018-11-10 02:41:29,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 38 letters. Loop has 7 letters. [2018-11-10 02:41:29,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:41:29,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 45 letters. Loop has 7 letters. [2018-11-10 02:41:29,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:41:29,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 38 letters. Loop has 14 letters. [2018-11-10 02:41:29,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 02:41:29,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 165 states and 177 transitions. [2018-11-10 02:41:29,424 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 02:41:29,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 165 states to 0 states and 0 transitions. [2018-11-10 02:41:29,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 02:41:29,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 02:41:29,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 02:41:29,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:41:29,424 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:41:29,425 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:41:29,425 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 02:41:29,425 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 02:41:29,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 02:41:29,425 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 02:41:29,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 02:41:29,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 02:41:29 BoogieIcfgContainer [2018-11-10 02:41:29,431 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 02:41:29,431 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 02:41:29,431 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 02:41:29,431 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 02:41:29,432 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:41:20" (3/4) ... [2018-11-10 02:41:29,434 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 02:41:29,434 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 02:41:29,435 INFO L168 Benchmark]: Toolchain (without parser) took 9211.41 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 369.6 MB). Free memory was 953.8 MB in the beginning and 956.5 MB in the end (delta: -2.7 MB). Peak memory consumption was 366.9 MB. Max. memory is 11.5 GB. [2018-11-10 02:41:29,435 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:41:29,436 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.72 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:41:29,436 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.17 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:41:29,436 INFO L168 Benchmark]: Boogie Preprocessor took 15.60 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:41:29,437 INFO L168 Benchmark]: RCFGBuilder took 303.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -200.2 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-10 02:41:29,437 INFO L168 Benchmark]: BuchiAutomizer took 8703.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 205.5 MB). Free memory was 1.1 GB in the beginning and 956.5 MB in the end (delta: 184.0 MB). Peak memory consumption was 389.6 MB. Max. memory is 11.5 GB. [2018-11-10 02:41:29,438 INFO L168 Benchmark]: Witness Printer took 3.35 ms. Allocated memory is still 1.4 GB. Free memory is still 956.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:41:29,440 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 156.72 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 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 26.17 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.60 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 303.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -200.2 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8703.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 205.5 MB). Free memory was 1.1 GB in the beginning and 956.5 MB in the end (delta: 184.0 MB). Peak memory consumption was 389.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.35 ms. Allocated memory is still 1.4 GB. Free memory is still 956.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 10 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 7 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 6.6s. Construction of modules took 0.3s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 31 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 214 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 154 SDtfs, 175 SDslu, 335 SDs, 0 SdLazy, 437 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital353 mio100 ax100 hnf100 lsp96 ukn46 mio100 lsp38 div100 bol100 ite100 ukn100 eq162 hnf90 smp90 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...