./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3f399015-0990-4782-8602-d9c51f678d9a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3f399015-0990-4782-8602-d9c51f678d9a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3f399015-0990-4782-8602-d9c51f678d9a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3f399015-0990-4782-8602-d9c51f678d9a/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3f399015-0990-4782-8602-d9c51f678d9a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3f399015-0990-4782-8602-d9c51f678d9a/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 205669a0469477740fa35099dd0e4ee1e635b686 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 04:32:16,609 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 04:32:16,610 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 04:32:16,616 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 04:32:16,616 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 04:32:16,616 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 04:32:16,617 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 04:32:16,618 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 04:32:16,618 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 04:32:16,619 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 04:32:16,619 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 04:32:16,619 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 04:32:16,620 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 04:32:16,620 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 04:32:16,621 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 04:32:16,621 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 04:32:16,622 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 04:32:16,622 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 04:32:16,623 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 04:32:16,624 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 04:32:16,625 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 04:32:16,625 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 04:32:16,626 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 04:32:16,626 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 04:32:16,626 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 04:32:16,627 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 04:32:16,627 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 04:32:16,628 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 04:32:16,628 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 04:32:16,629 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 04:32:16,629 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 04:32:16,629 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 04:32:16,629 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 04:32:16,629 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 04:32:16,630 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 04:32:16,630 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 04:32:16,630 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3f399015-0990-4782-8602-d9c51f678d9a/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 04:32:16,638 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 04:32:16,638 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 04:32:16,639 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 04:32:16,639 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 04:32:16,639 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 04:32:16,639 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 04:32:16,639 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 04:32:16,639 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 04:32:16,639 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 04:32:16,639 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 04:32:16,639 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 04:32:16,639 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 04:32:16,640 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 04:32:16,640 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 04:32:16,640 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 04:32:16,640 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 04:32:16,640 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 04:32:16,640 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 04:32:16,640 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 04:32:16,640 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 04:32:16,640 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 04:32:16,640 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 04:32:16,640 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 04:32:16,641 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 04:32:16,641 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 04:32:16,641 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 04:32:16,641 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 04:32:16,641 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 04:32:16,641 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 04:32:16,642 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_3f399015-0990-4782-8602-d9c51f678d9a/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 -> 205669a0469477740fa35099dd0e4ee1e635b686 [2018-12-09 04:32:16,659 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 04:32:16,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 04:32:16,670 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 04:32:16,671 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 04:32:16,672 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 04:32:16,672 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3f399015-0990-4782-8602-d9c51f678d9a/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2_true-termination.c.i [2018-12-09 04:32:16,714 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f399015-0990-4782-8602-d9c51f678d9a/bin-2019/uautomizer/data/5d0c6fe9b/b2776cf6891e41faa2458eee162061a8/FLAGddaefa275 [2018-12-09 04:32:17,113 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 04:32:17,114 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3f399015-0990-4782-8602-d9c51f678d9a/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2_true-termination.c.i [2018-12-09 04:32:17,117 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f399015-0990-4782-8602-d9c51f678d9a/bin-2019/uautomizer/data/5d0c6fe9b/b2776cf6891e41faa2458eee162061a8/FLAGddaefa275 [2018-12-09 04:32:17,126 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3f399015-0990-4782-8602-d9c51f678d9a/bin-2019/uautomizer/data/5d0c6fe9b/b2776cf6891e41faa2458eee162061a8 [2018-12-09 04:32:17,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 04:32:17,128 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 04:32:17,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 04:32:17,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 04:32:17,131 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 04:32:17,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:32:17" (1/1) ... [2018-12-09 04:32:17,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@374725de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:32:17, skipping insertion in model container [2018-12-09 04:32:17,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:32:17" (1/1) ... [2018-12-09 04:32:17,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 04:32:17,146 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 04:32:17,229 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:32:17,235 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 04:32:17,245 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:32:17,253 INFO L195 MainTranslator]: Completed translation [2018-12-09 04:32:17,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:32:17 WrapperNode [2018-12-09 04:32:17,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 04:32:17,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 04:32:17,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 04:32:17,254 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 04:32:17,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:32:17" (1/1) ... [2018-12-09 04:32:17,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:32:17" (1/1) ... [2018-12-09 04:32:17,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 04:32:17,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 04:32:17,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 04:32:17,274 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 04:32:17,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:32:17" (1/1) ... [2018-12-09 04:32:17,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:32:17" (1/1) ... [2018-12-09 04:32:17,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:32:17" (1/1) ... [2018-12-09 04:32:17,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:32:17" (1/1) ... [2018-12-09 04:32:17,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:32:17" (1/1) ... [2018-12-09 04:32:17,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:32:17" (1/1) ... [2018-12-09 04:32:17,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:32:17" (1/1) ... [2018-12-09 04:32:17,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 04:32:17,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 04:32:17,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 04:32:17,322 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 04:32:17,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:32:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f399015-0990-4782-8602-d9c51f678d9a/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-12-09 04:32:17,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 04:32:17,358 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-12-09 04:32:17,358 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-12-09 04:32:17,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 04:32:17,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 04:32:17,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 04:32:17,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 04:32:17,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 04:32:17,457 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 04:32:17,457 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-09 04:32:17,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:32:17 BoogieIcfgContainer [2018-12-09 04:32:17,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 04:32:17,458 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 04:32:17,458 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 04:32:17,460 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 04:32:17,461 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 04:32:17,461 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 04:32:17" (1/3) ... [2018-12-09 04:32:17,461 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50ad65ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 04:32:17, skipping insertion in model container [2018-12-09 04:32:17,461 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 04:32:17,461 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:32:17" (2/3) ... [2018-12-09 04:32:17,462 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50ad65ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 04:32:17, skipping insertion in model container [2018-12-09 04:32:17,462 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 04:32:17,462 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:32:17" (3/3) ... [2018-12-09 04:32:17,463 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex2_true-termination.c.i [2018-12-09 04:32:17,492 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 04:32:17,492 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 04:32:17,492 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 04:32:17,492 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 04:32:17,492 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 04:32:17,492 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 04:32:17,492 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 04:32:17,492 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 04:32:17,492 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 04:32:17,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-09 04:32:17,515 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-09 04:32:17,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:32:17,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:32:17,519 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 04:32:17,520 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:32:17,520 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 04:32:17,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-12-09 04:32:17,521 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-09 04:32:17,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:32:17,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:32:17,521 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 04:32:17,521 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:32:17,526 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 7#L23-3true [2018-12-09 04:32:17,526 INFO L796 eck$LassoCheckResult]: Loop: 7#L23-3true call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 12#L23-1true assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 3#L26true call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 4#recENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 10#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 15#recFINALtrue assume true; 13#recEXITtrue >#31#return; 17#L26-1true call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 7#L23-3true [2018-12-09 04:32:17,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:17,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2018-12-09 04:32:17,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:32:17,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:32:17,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:17,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:32:17,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:17,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:17,600 INFO L82 PathProgramCache]: Analyzing trace with hash -5927165, now seen corresponding path program 1 times [2018-12-09 04:32:17,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:32:17,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:32:17,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:17,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:32:17,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:32:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:32:17,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:32:17,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:32:17,691 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 04:32:17,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:32:17,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:32:17,701 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 7 states. [2018-12-09 04:32:17,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:32:17,755 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-12-09 04:32:17,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:32:17,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2018-12-09 04:32:17,758 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-09 04:32:17,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2018-12-09 04:32:17,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-09 04:32:17,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-12-09 04:32:17,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-12-09 04:32:17,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 04:32:17,765 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-09 04:32:17,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-12-09 04:32:17,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-09 04:32:17,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-09 04:32:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-09 04:32:17,783 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-09 04:32:17,783 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-09 04:32:17,783 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 04:32:17,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2018-12-09 04:32:17,784 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-09 04:32:17,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:32:17,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:32:17,784 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 04:32:17,784 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:32:17,785 INFO L794 eck$LassoCheckResult]: Stem: 52#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 49#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 50#L23-3 [2018-12-09 04:32:17,785 INFO L796 eck$LassoCheckResult]: Loop: 50#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 53#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 46#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 51#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 45#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 47#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 51#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 45#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 48#recFINAL assume true; 54#recEXIT >#29#return; 55#L17-1 #res := #t~ret6;havoc #t~ret6; 56#recFINAL assume true; 58#recEXIT >#31#return; 57#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 50#L23-3 [2018-12-09 04:32:17,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:17,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2018-12-09 04:32:17,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:32:17,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:32:17,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:17,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:32:17,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:17,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:17,794 INFO L82 PathProgramCache]: Analyzing trace with hash -741726607, now seen corresponding path program 1 times [2018-12-09 04:32:17,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:32:17,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:32:17,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:17,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:32:17,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:32:17,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 04:32:17,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:32:17,900 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f399015-0990-4782-8602-d9c51f678d9a/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:32:17,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:32:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:32:17,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:32:17,973 INFO L478 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 23 treesize of output 33 [2018-12-09 04:32:17,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 21 [2018-12-09 04:32:17,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:32:17,995 INFO L478 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 20 treesize of output 19 [2018-12-09 04:32:17,996 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:32:18,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:32:18,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 04:32:18,007 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-12-09 04:32:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 04:32:18,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:32:18,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-12-09 04:32:18,087 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 04:32:18,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 04:32:18,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-12-09 04:32:18,087 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 14 states. [2018-12-09 04:32:18,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:32:18,184 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-12-09 04:32:18,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 04:32:18,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2018-12-09 04:32:18,185 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-09 04:32:18,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2018-12-09 04:32:18,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-09 04:32:18,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-09 04:32:18,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2018-12-09 04:32:18,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 04:32:18,186 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-09 04:32:18,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2018-12-09 04:32:18,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-09 04:32:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-09 04:32:18,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-12-09 04:32:18,188 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-09 04:32:18,188 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-09 04:32:18,188 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 04:32:18,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2018-12-09 04:32:18,189 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-09 04:32:18,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:32:18,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:32:18,190 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 04:32:18,190 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-09 04:32:18,190 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 136#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 137#L23-3 [2018-12-09 04:32:18,190 INFO L796 eck$LassoCheckResult]: Loop: 137#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 144#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 140#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 142#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 138#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 139#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 142#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 138#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 139#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 142#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 138#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 141#recFINAL assume true; 145#recEXIT >#29#return; 146#L17-1 #res := #t~ret6;havoc #t~ret6; 147#recFINAL assume true; 152#recEXIT >#29#return; 150#L17-1 #res := #t~ret6;havoc #t~ret6; 151#recFINAL assume true; 149#recEXIT >#31#return; 148#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 137#L23-3 [2018-12-09 04:32:18,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:18,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 3 times [2018-12-09 04:32:18,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:32:18,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:32:18,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:18,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:32:18,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:18,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:18,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1620168125, now seen corresponding path program 2 times [2018-12-09 04:32:18,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:32:18,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:32:18,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:18,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:32:18,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:32:18,307 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 04:32:18,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:32:18,308 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f399015-0990-4782-8602-d9c51f678d9a/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:32:18,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 04:32:18,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 04:32:18,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:32:18,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:32:18,365 INFO L478 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 23 treesize of output 33 [2018-12-09 04:32:18,368 INFO L478 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 24 treesize of output 23 [2018-12-09 04:32:18,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:32:18,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:32:18,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 04:32:18,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-12-09 04:32:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 04:32:18,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:32:18,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-12-09 04:32:18,488 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 04:32:18,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 04:32:18,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-12-09 04:32:18,489 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand 17 states. [2018-12-09 04:32:18,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:32:18,576 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-12-09 04:32:18,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 04:32:18,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2018-12-09 04:32:18,577 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-09 04:32:18,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2018-12-09 04:32:18,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-09 04:32:18,578 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-09 04:32:18,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2018-12-09 04:32:18,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 04:32:18,578 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-12-09 04:32:18,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2018-12-09 04:32:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-09 04:32:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 04:32:18,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-12-09 04:32:18,580 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-12-09 04:32:18,580 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-12-09 04:32:18,580 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 04:32:18,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2018-12-09 04:32:18,580 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-09 04:32:18,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:32:18,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:32:18,581 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-09 04:32:18,581 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-12-09 04:32:18,581 INFO L794 eck$LassoCheckResult]: Stem: 261#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 254#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 255#L23-3 [2018-12-09 04:32:18,581 INFO L796 eck$LassoCheckResult]: Loop: 255#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 262#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 258#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 260#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 256#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 257#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 260#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 256#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 257#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 260#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 256#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 257#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 260#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 256#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 259#recFINAL assume true; 273#recEXIT >#29#return; 266#L17-1 #res := #t~ret6;havoc #t~ret6; 265#recFINAL assume true; 263#recEXIT >#29#return; 264#L17-1 #res := #t~ret6;havoc #t~ret6; 272#recFINAL assume true; 271#recEXIT >#29#return; 269#L17-1 #res := #t~ret6;havoc #t~ret6; 270#recFINAL assume true; 268#recEXIT >#31#return; 267#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 255#L23-3 [2018-12-09 04:32:18,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:18,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 4 times [2018-12-09 04:32:18,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:32:18,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:32:18,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:18,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:32:18,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:18,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:18,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1930575665, now seen corresponding path program 3 times [2018-12-09 04:32:18,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:32:18,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:32:18,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:18,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:32:18,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:18,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:18,632 INFO L82 PathProgramCache]: Analyzing trace with hash 650376563, now seen corresponding path program 1 times [2018-12-09 04:32:18,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:32:18,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:32:18,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:18,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:32:18,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:18,929 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2018-12-09 04:32:19,253 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 110 [2018-12-09 04:32:19,625 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 118 [2018-12-09 04:32:20,228 WARN L180 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 122 [2018-12-09 04:32:20,336 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-12-09 04:32:20,400 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 04:32:20,401 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 04:32:20,401 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 04:32:20,401 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 04:32:20,401 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 04:32:20,401 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 04:32:20,401 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 04:32:20,401 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 04:32:20,402 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2_true-termination.c.i_Iteration4_Lasso [2018-12-09 04:32:20,402 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 04:32:20,402 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 04:32:20,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:20,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:20,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:20,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:20,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:20,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:20,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:20,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:20,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:20,729 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 04:32:20,732 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 04:32:20,734 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-12-09 04:32:20,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:20,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:20,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:20,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:20,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:20,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:20,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:20,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:20,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:32:20,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:20,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:20,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:20,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:20,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:20,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:20,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:20,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:20,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:32:20,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:20,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:20,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:20,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:20,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:20,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:20,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:20,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:20,745 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-12-09 04:32:20,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:20,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:20,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:20,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:20,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:20,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:20,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:20,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:20,747 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-12-09 04:32:20,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:20,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:20,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:20,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:20,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:32:20,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:32:20,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:20,752 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-12-09 04:32:20,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:20,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:20,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:20,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:20,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:20,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:20,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:20,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:20,754 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-12-09 04:32:20,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:20,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:20,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:20,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:20,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:32:20,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:32:20,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:20,759 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-12-09 04:32:20,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:20,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:20,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:20,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:20,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:20,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:20,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:20,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:20,761 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-12-09 04:32:20,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:20,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:20,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:20,762 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 04:32:20,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:20,763 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 04:32:20,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:20,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:20,766 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-12-09 04:32:20,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:20,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:20,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:20,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:20,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:32:20,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:32:20,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:20,778 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-12-09 04:32:20,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:20,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:20,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:20,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:20,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:20,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:20,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:20,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:20,780 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-12-09 04:32:20,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:20,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:20,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:20,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:20,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:20,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:20,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:20,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:20,783 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-12-09 04:32:20,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:20,783 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 04:32:20,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:20,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:20,785 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 04:32:20,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:32:20,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:20,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:32:20,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:20,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:20,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:20,790 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 04:32:20,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:20,791 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 04:32:20,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:20,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:20,792 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-12-09 04:32:20,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:20,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:20,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:20,792 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 04:32:20,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:20,793 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 04:32:20,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:20,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:20,794 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-12-09 04:32:20,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:20,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:20,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:20,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:20,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:32:20,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:32:20,811 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 04:32:20,816 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 04:32:20,816 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 04:32:20,818 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 04:32:20,819 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 04:32:20,819 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 04:32:20,820 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~ip~0.base) ULTIMATE.start_main_~ip~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~ip~0.base) ULTIMATE.start_main_~ip~0.offset)_1 Supporting invariants [] [2018-12-09 04:32:20,829 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-09 04:32:20,833 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 04:32:20,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:32:20,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:32:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:32:20,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:32:20,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:32:20,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:32:20,914 INFO L478 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-12-09 04:32:20,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:32:20,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-09 04:32:20,921 INFO L478 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-12-09 04:32:20,922 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:32:20,924 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:32:20,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:32:20,927 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2018-12-09 04:32:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-09 04:32:21,006 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-12-09 04:32:21,007 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 9 states. [2018-12-09 04:32:21,110 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 22 transitions. cyclomatic complexity: 4. Second operand 9 states. Result 66 states and 73 transitions. Complement of second has 24 states. [2018-12-09 04:32:21,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-12-09 04:32:21,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-09 04:32:21,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2018-12-09 04:32:21,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 14 transitions. Stem has 2 letters. Loop has 26 letters. [2018-12-09 04:32:21,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:32:21,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 14 transitions. Stem has 28 letters. Loop has 26 letters. [2018-12-09 04:32:21,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:32:21,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 14 transitions. Stem has 2 letters. Loop has 52 letters. [2018-12-09 04:32:21,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:32:21,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 73 transitions. [2018-12-09 04:32:21,115 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 04:32:21,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 35 states and 40 transitions. [2018-12-09 04:32:21,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-09 04:32:21,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 04:32:21,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2018-12-09 04:32:21,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 04:32:21,116 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-12-09 04:32:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2018-12-09 04:32:21,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2018-12-09 04:32:21,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 04:32:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-12-09 04:32:21,118 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-09 04:32:21,118 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-09 04:32:21,118 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 04:32:21,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2018-12-09 04:32:21,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 04:32:21,119 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:32:21,119 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:32:21,119 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 04:32:21,119 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 04:32:21,119 INFO L794 eck$LassoCheckResult]: Stem: 502#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 489#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 490#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 503#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 492#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 498#recENTRY [2018-12-09 04:32:21,119 INFO L796 eck$LassoCheckResult]: Loop: 498#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 491#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 493#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 498#recENTRY [2018-12-09 04:32:21,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:21,119 INFO L82 PathProgramCache]: Analyzing trace with hash 36330294, now seen corresponding path program 1 times [2018-12-09 04:32:21,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:32:21,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:32:21,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:21,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:32:21,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:21,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:21,127 INFO L82 PathProgramCache]: Analyzing trace with hash 29943, now seen corresponding path program 1 times [2018-12-09 04:32:21,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:32:21,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:32:21,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:21,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:32:21,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:21,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:21,132 INFO L82 PathProgramCache]: Analyzing trace with hash -15969886, now seen corresponding path program 1 times [2018-12-09 04:32:21,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:32:21,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:32:21,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:21,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:32:21,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:21,425 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2018-12-09 04:32:21,559 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 04:32:21,559 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 04:32:21,559 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 04:32:21,560 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 04:32:21,560 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 04:32:21,560 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 04:32:21,560 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 04:32:21,560 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 04:32:21,560 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2_true-termination.c.i_Iteration5_Lasso [2018-12-09 04:32:21,560 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 04:32:21,560 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 04:32:21,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:21,856 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 04:32:21,856 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 04:32:21,856 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-12-09 04:32:21,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:21,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:21,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:21,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:21,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:21,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:21,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:21,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:21,858 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-12-09 04:32:21,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:21,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:21,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:21,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:21,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:21,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:21,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:21,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:21,859 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-12-09 04:32:21,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:21,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:21,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:21,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:21,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:21,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:21,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:21,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:21,860 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-12-09 04:32:21,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:21,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:21,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:21,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:21,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:21,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:21,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:21,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:21,862 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-12-09 04:32:21,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:21,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:21,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:21,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:21,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:21,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:21,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:21,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:21,864 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-12-09 04:32:21,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:21,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:21,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:21,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:21,864 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:32:21,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:32:21,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:21,865 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-12-09 04:32:21,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:21,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:21,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:21,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:21,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:21,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:21,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:21,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:21,866 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-12-09 04:32:21,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:21,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:21,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:21,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:21,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:21,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:21,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:21,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:21,868 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-12-09 04:32:21,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:21,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:21,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:21,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:21,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:21,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:21,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:21,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:21,869 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-12-09 04:32:21,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:21,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:21,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:21,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:21,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:21,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:21,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:21,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:21,870 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-12-09 04:32:21,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:21,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:21,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:21,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:21,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:21,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:21,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:21,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:21,871 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-12-09 04:32:21,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:21,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:21,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:21,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:21,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:21,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:21,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:21,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:21,872 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-12-09 04:32:21,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:21,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:21,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:21,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:21,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:32:21,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:32:21,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:21,881 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-12-09 04:32:21,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:21,882 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 04:32:21,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:21,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:21,883 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 04:32:21,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:32:21,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:21,886 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-12-09 04:32:21,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:21,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:21,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:21,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:21,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:32:21,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:32:21,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:21,891 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-12-09 04:32:21,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:21,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:21,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:21,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:21,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:32:21,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:32:21,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:21,894 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-12-09 04:32:21,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:21,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:21,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:21,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:21,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:32:21,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:32:21,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:21,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:32:21,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:21,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:21,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:21,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:21,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:32:21,902 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:32:21,912 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 04:32:21,923 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-09 04:32:21,923 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-09 04:32:21,923 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 04:32:21,925 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2018-12-09 04:32:21,925 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 04:32:21,925 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select old(#memory_int) rec_#in~p.base) rec_#in~p.offset)_1) = 2*v_rep(select (select old(#memory_int) rec_#in~p.base) rec_#in~p.offset)_1 + 3 Supporting invariants [1*v_rep(select (select old(#memory_int) rec_#in~p.base) rec_#in~p.offset)_1 + 1 >= 0, -1*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1 + 1*v_rep(select (select old(#memory_int) rec_#in~p.base) rec_#in~p.offset)_1 >= 0] [2018-12-09 04:32:21,940 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2018-12-09 04:32:21,943 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 04:32:21,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:32:21,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:32:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:32:21,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:32:21,979 INFO L478 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 23 treesize of output 19 [2018-12-09 04:32:21,981 INFO L478 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 19 treesize of output 15 [2018-12-09 04:32:21,981 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:32:21,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:32:21,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:32:21,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:22 [2018-12-09 04:32:22,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:32:22,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-12-09 04:32:22,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:32:22,005 INFO L478 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 0 case distinctions, treesize of input 33 treesize of output 22 [2018-12-09 04:32:22,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:32:22,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:32:22,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:32:22,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:26 [2018-12-09 04:32:22,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:32:22,023 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 04:32:22,024 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 7 Second operand 4 states. [2018-12-09 04:32:22,085 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 33 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 57 states and 66 transitions. Complement of second has 14 states. [2018-12-09 04:32:22,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 04:32:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 04:32:22,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-12-09 04:32:22,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 3 letters. [2018-12-09 04:32:22,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:32:22,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 3 letters. [2018-12-09 04:32:22,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:32:22,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 5 letters. Loop has 6 letters. [2018-12-09 04:32:22,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:32:22,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. [2018-12-09 04:32:22,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 04:32:22,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 40 states and 48 transitions. [2018-12-09 04:32:22,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-09 04:32:22,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-09 04:32:22,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 48 transitions. [2018-12-09 04:32:22,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 04:32:22,090 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-12-09 04:32:22,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 48 transitions. [2018-12-09 04:32:22,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-09 04:32:22,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 04:32:22,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-12-09 04:32:22,093 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-12-09 04:32:22,093 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-12-09 04:32:22,093 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 04:32:22,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2018-12-09 04:32:22,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 04:32:22,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:32:22,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:32:22,095 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-09 04:32:22,095 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 04:32:22,096 INFO L794 eck$LassoCheckResult]: Stem: 671#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 659#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 660#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 683#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 685#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 697#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 696#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 665#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 678#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 664#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 666#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 678#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 664#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 666#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 678#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 692#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 693#recFINAL assume true; 698#recEXIT >#29#return; 680#L17-1 #res := #t~ret6;havoc #t~ret6; 679#recFINAL assume true; 674#recEXIT >#29#return; 677#L17-1 #res := #t~ret6;havoc #t~ret6; 689#recFINAL assume true; 688#recEXIT >#29#return; 687#L17-1 #res := #t~ret6;havoc #t~ret6; 686#recFINAL assume true; 684#recEXIT >#31#return; 681#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 682#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 672#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 663#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 667#recENTRY [2018-12-09 04:32:22,096 INFO L796 eck$LassoCheckResult]: Loop: 667#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 661#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 662#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 667#recENTRY [2018-12-09 04:32:22,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:22,096 INFO L82 PathProgramCache]: Analyzing trace with hash 770731142, now seen corresponding path program 2 times [2018-12-09 04:32:22,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:32:22,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:32:22,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:22,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:32:22,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:32:22,259 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 04:32:22,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:32:22,260 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f399015-0990-4782-8602-d9c51f678d9a/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:32:22,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 04:32:22,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 04:32:22,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:32:22,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:32:22,297 INFO L478 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 6 treesize of output 5 [2018-12-09 04:32:22,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:32:22,302 INFO L478 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 11 treesize of output 8 [2018-12-09 04:32:22,303 INFO L478 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-12-09 04:32:22,303 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:32:22,305 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:32:22,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:32:22,311 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:18, output treesize:5 [2018-12-09 04:32:22,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:32:22,315 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:32:22,315 INFO L478 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-12-09 04:32:22,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 04:32:22,325 INFO L478 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 15 treesize of output 17 [2018-12-09 04:32:22,327 INFO L478 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 12 treesize of output 11 [2018-12-09 04:32:22,327 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 04:32:22,329 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:32:22,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:32:22,333 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:23 [2018-12-09 04:32:22,587 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:32:22,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-12-09 04:32:22,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:32:22,593 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-12-09 04:32:22,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:32:22,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:32:22,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 04:32:22,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:41 [2018-12-09 04:32:22,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:32:22,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 55 [2018-12-09 04:32:22,645 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-12-09 04:32:22,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:32:22,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:32:22,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 04:32:22,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:29 [2018-12-09 04:32:22,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2018-12-09 04:32:22,683 INFO L478 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 17 treesize of output 13 [2018-12-09 04:32:22,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:32:22,690 INFO L478 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 17 treesize of output 13 [2018-12-09 04:32:22,690 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:32:22,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:32:22,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 04:32:22,698 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:36, output treesize:13 [2018-12-09 04:32:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 04:32:22,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:32:22,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 31 [2018-12-09 04:32:22,726 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 04:32:22,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:22,726 INFO L82 PathProgramCache]: Analyzing trace with hash 29943, now seen corresponding path program 2 times [2018-12-09 04:32:22,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:32:22,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:32:22,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:22,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:32:22,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:22,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-09 04:32:22,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2018-12-09 04:32:22,905 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 12 Second operand 31 states. [2018-12-09 04:32:23,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:32:23,129 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2018-12-09 04:32:23,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 04:32:23,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2018-12-09 04:32:23,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 04:32:23,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 46 states and 58 transitions. [2018-12-09 04:32:23,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-09 04:32:23,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-12-09 04:32:23,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2018-12-09 04:32:23,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 04:32:23,132 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-12-09 04:32:23,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2018-12-09 04:32:23,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-12-09 04:32:23,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 04:32:23,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-12-09 04:32:23,135 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-12-09 04:32:23,135 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-12-09 04:32:23,135 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 04:32:23,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2018-12-09 04:32:23,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 04:32:23,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:32:23,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:32:23,137 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-09 04:32:23,137 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 04:32:23,137 INFO L794 eck$LassoCheckResult]: Stem: 904#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 895#L-1 havoc main_#res;havoc main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~nondet8, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~mem11, main_#t~mem13, main_#t~ret12, main_~op~0.base, main_~op~0.offset, main_#t~mem9, main_~ip~0.base, main_~ip~0.offset;call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc(4);main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~nondet8; 896#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 906#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 898#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 899#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 921#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 892#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 925#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 923#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 893#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 925#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 923#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 893#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 925#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 923#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 893#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 925#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 891#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~p.base, ~p.offset, 4);~pv~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~p.base, ~p.offset);call ULTIMATE.dealloc(~up.base, ~up.offset);#res := ~pv~0; 894#recFINAL assume true; 909#recEXIT >#29#return; 910#L17-1 #res := #t~ret6;havoc #t~ret6; 911#recFINAL assume true; 907#recEXIT >#29#return; 908#L17-1 #res := #t~ret6;havoc #t~ret6; 926#recFINAL assume true; 924#recEXIT >#29#return; 920#L17-1 #res := #t~ret6;havoc #t~ret6; 922#recFINAL assume true; 919#recEXIT >#29#return; 918#L17-1 #res := #t~ret6;havoc #t~ret6; 917#recFINAL assume true; 915#recEXIT >#31#return; 912#L26-1 call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem13; 913#L23-3 call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 905#L23-1 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4);main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4);call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4);havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); 890#L26 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 897#recENTRY [2018-12-09 04:32:23,137 INFO L796 eck$LassoCheckResult]: Loop: 897#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset;call #t~mem1 := read~int(~p.base, ~p.offset, 4); 888#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~p.base, ~p.offset, 4);#t~post5 := #t~mem4;call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4);havoc #t~mem4;havoc #t~post5; 889#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 897#recENTRY [2018-12-09 04:32:23,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:23,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1655830132, now seen corresponding path program 3 times [2018-12-09 04:32:23,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:32:23,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:32:23,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:23,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:32:23,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:23,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:23,166 INFO L82 PathProgramCache]: Analyzing trace with hash 29943, now seen corresponding path program 3 times [2018-12-09 04:32:23,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:32:23,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:32:23,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:23,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:32:23,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:23,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:23,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1136068004, now seen corresponding path program 4 times [2018-12-09 04:32:23,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:32:23,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:32:23,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:23,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:32:23,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:32:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:32:23,569 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2018-12-09 04:32:23,847 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 110 [2018-12-09 04:32:24,210 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 118 [2018-12-09 04:32:24,634 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 126 [2018-12-09 04:32:25,779 WARN L180 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 201 [2018-12-09 04:32:25,992 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-09 04:32:26,210 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2018-12-09 04:32:26,355 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-09 04:32:26,357 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 04:32:26,357 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 04:32:26,357 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 04:32:26,358 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 04:32:26,358 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 04:32:26,358 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 04:32:26,358 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 04:32:26,358 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 04:32:26,358 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2_true-termination.c.i_Iteration7_Lasso [2018-12-09 04:32:26,358 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 04:32:26,358 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 04:32:26,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:32:26,826 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 04:32:26,826 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 04:32:26,827 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-12-09 04:32:26,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,828 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-12-09 04:32:26,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,830 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-12-09 04:32:26,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,831 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-12-09 04:32:26,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,833 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-12-09 04:32:26,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:32:26,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:32:26,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,835 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-12-09 04:32:26,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,836 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-12-09 04:32:26,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,837 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-12-09 04:32:26,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,839 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-12-09 04:32:26,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,840 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-12-09 04:32:26,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,842 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-12-09 04:32:26,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,843 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-12-09 04:32:26,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:32:26,844 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:32:26,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,845 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-12-09 04:32:26,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,847 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-12-09 04:32:26,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,848 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-12-09 04:32:26,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,850 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-12-09 04:32:26,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,851 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-12-09 04:32:26,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,853 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-12-09 04:32:26,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,853 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,854 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-12-09 04:32:26,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,855 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-12-09 04:32:26,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,857 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-12-09 04:32:26,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,858 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-12-09 04:32:26,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,859 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-12-09 04:32:26,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,861 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-12-09 04:32:26,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,862 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-12-09 04:32:26,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,864 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-12-09 04:32:26,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,865 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-12-09 04:32:26,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,867 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-12-09 04:32:26,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,868 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-12-09 04:32:26,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,869 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-12-09 04:32:26,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:32:26,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:32:26,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:32:26,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,870 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-12-09 04:32:26,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,871 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:32:26,871 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:32:26,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,872 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-12-09 04:32:26,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,873 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 04:32:26,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,873 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 04:32:26,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:32:26,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,874 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-12-09 04:32:26,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,874 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 04:32:26,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,875 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 04:32:26,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:32:26,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,876 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-12-09 04:32:26,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:32:26,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:32:26,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:32:26,878 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-12-09 04:32:26,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:32:26,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:32:26,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:32:26,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:32:26,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:32:26,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:32:26,887 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 04:32:26,891 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 04:32:26,892 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 04:32:26,892 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 04:32:26,892 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 04:32:26,892 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 04:32:26,892 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) 0)_1) = 2*v_rep(select (select #memory_int rec_#in~p.base) 0)_1 + 1 Supporting invariants [] [2018-12-09 04:32:26,906 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2018-12-09 04:32:26,908 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 04:32:26,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:32:26,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:32:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:32:27,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:32:27,014 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:32:27,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-12-09 04:32:27,017 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:32:27,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-12-09 04:32:27,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:32:27,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:32:27,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:32:27,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2018-12-09 04:32:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:32:27,033 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-12-09 04:32:27,033 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 6 states. [2018-12-09 04:32:27,088 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 50 states and 59 transitions. Complement of second has 15 states. [2018-12-09 04:32:27,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 04:32:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 04:32:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-12-09 04:32:27,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 37 letters. Loop has 3 letters. [2018-12-09 04:32:27,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:32:27,090 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 04:32:27,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:32:27,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:32:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:32:27,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:32:27,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:32:27,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-12-09 04:32:27,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:32:27,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-12-09 04:32:27,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:32:27,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:32:27,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:32:27,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2018-12-09 04:32:27,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:32:27,200 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 3 loop predicates [2018-12-09 04:32:27,200 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 6 states. [2018-12-09 04:32:27,254 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 50 states and 59 transitions. Complement of second has 15 states. [2018-12-09 04:32:27,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 04:32:27,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 04:32:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2018-12-09 04:32:27,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 37 letters. Loop has 3 letters. [2018-12-09 04:32:27,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:32:27,255 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 04:32:27,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:32:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:32:27,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:32:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:32:27,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:32:27,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:32:27,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-12-09 04:32:27,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:32:27,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-12-09 04:32:27,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:32:27,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:32:27,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:32:27,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2018-12-09 04:32:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:32:27,371 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-12-09 04:32:27,371 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 6 states. [2018-12-09 04:32:27,454 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 63 states and 72 transitions. Complement of second has 16 states. [2018-12-09 04:32:27,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 04:32:27,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-09 04:32:27,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-12-09 04:32:27,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 37 letters. Loop has 3 letters. [2018-12-09 04:32:27,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:32:27,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 40 letters. Loop has 3 letters. [2018-12-09 04:32:27,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:32:27,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 37 letters. Loop has 6 letters. [2018-12-09 04:32:27,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:32:27,455 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 72 transitions. [2018-12-09 04:32:27,456 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 04:32:27,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 0 states and 0 transitions. [2018-12-09 04:32:27,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 04:32:27,456 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 04:32:27,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 04:32:27,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 04:32:27,456 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 04:32:27,456 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 04:32:27,456 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 04:32:27,456 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-09 04:32:27,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 04:32:27,456 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 04:32:27,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 04:32:27,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 04:32:27 BoogieIcfgContainer [2018-12-09 04:32:27,460 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 04:32:27,460 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 04:32:27,460 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 04:32:27,461 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 04:32:27,461 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:32:17" (3/4) ... [2018-12-09 04:32:27,463 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 04:32:27,463 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 04:32:27,463 INFO L168 Benchmark]: Toolchain (without parser) took 10335.75 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 379.6 MB). Free memory was 953.3 MB in the beginning and 1.0 GB in the end (delta: -86.5 MB). Peak memory consumption was 293.1 MB. Max. memory is 11.5 GB. [2018-12-09 04:32:27,464 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:32:27,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 125.29 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 04:32:27,464 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.05 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:32:27,464 INFO L168 Benchmark]: Boogie Preprocessor took 47.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -199.6 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-09 04:32:27,465 INFO L168 Benchmark]: RCFGBuilder took 135.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-12-09 04:32:27,465 INFO L168 Benchmark]: BuchiAutomizer took 10002.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 232.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.6 MB). Peak memory consumption was 319.8 MB. Max. memory is 11.5 GB. [2018-12-09 04:32:27,465 INFO L168 Benchmark]: Witness Printer took 2.57 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:32:27,467 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 125.29 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 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 20.05 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -199.6 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 135.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10002.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 232.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 87.6 MB). Peak memory consumption was 319.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.57 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[ip][ip] and consists of 9 locations. One deterministic module has affine ranking function 2 * \old(unknown-#memory_int-unknown)[p][p] + 3 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][0] + 1 and consists of 7 locations. 4 modules have a trivial ranking function, the largest among these consists of 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.9s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 8.4s. Construction of modules took 0.3s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 43 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 30/30 HoareTripleCheckerStatistics: 84 SDtfs, 61 SDslu, 218 SDs, 0 SdLazy, 569 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital345 mio100 ax100 hnf100 lsp97 ukn51 mio100 lsp29 div100 bol100 ite100 ukn100 eq188 hnf88 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...