./Ultimate.py --spec ../../sv-benchmarks/c/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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b02764ca-8242-4c1c-9a1d-0a46326013ce/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b02764ca-8242-4c1c-9a1d-0a46326013ce/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b02764ca-8242-4c1c-9a1d-0a46326013ce/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b02764ca-8242-4c1c-9a1d-0a46326013ce/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_b02764ca-8242-4c1c-9a1d-0a46326013ce/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b02764ca-8242-4c1c-9a1d-0a46326013ce/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-1dbac8b [2018-11-10 09:25:21,676 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:25:21,677 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:25:21,685 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:25:21,685 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:25:21,686 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:25:21,687 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:25:21,688 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:25:21,689 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:25:21,690 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:25:21,690 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:25:21,690 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:25:21,691 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:25:21,692 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:25:21,692 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:25:21,693 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:25:21,693 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:25:21,695 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:25:21,696 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:25:21,697 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:25:21,698 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:25:21,698 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:25:21,700 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:25:21,700 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:25:21,700 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:25:21,701 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:25:21,702 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:25:21,702 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:25:21,703 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:25:21,704 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:25:21,704 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:25:21,704 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:25:21,704 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:25:21,705 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:25:21,705 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:25:21,706 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:25:21,706 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b02764ca-8242-4c1c-9a1d-0a46326013ce/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 09:25:21,716 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:25:21,717 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:25:21,717 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 09:25:21,718 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 09:25:21,718 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 09:25:21,718 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 09:25:21,718 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 09:25:21,718 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 09:25:21,718 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 09:25:21,719 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 09:25:21,719 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 09:25:21,719 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:25:21,719 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 09:25:21,719 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:25:21,719 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:25:21,719 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 09:25:21,719 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 09:25:21,720 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 09:25:21,720 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:25:21,720 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 09:25:21,720 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 09:25:21,720 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:25:21,720 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:25:21,720 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 09:25:21,721 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:25:21,721 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 09:25:21,721 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 09:25:21,721 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 09:25:21,722 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_b02764ca-8242-4c1c-9a1d-0a46326013ce/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-11-10 09:25:21,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:25:21,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:25:21,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:25:21,753 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:25:21,753 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:25:21,754 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b02764ca-8242-4c1c-9a1d-0a46326013ce/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2_true-termination.c.i [2018-11-10 09:25:21,790 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b02764ca-8242-4c1c-9a1d-0a46326013ce/bin-2019/uautomizer/data/47b046f56/811de74aff874f13bcec94c6b086eb7c/FLAGa75cc2663 [2018-11-10 09:25:22,095 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:25:22,095 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b02764ca-8242-4c1c-9a1d-0a46326013ce/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex2_true-termination.c.i [2018-11-10 09:25:22,099 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b02764ca-8242-4c1c-9a1d-0a46326013ce/bin-2019/uautomizer/data/47b046f56/811de74aff874f13bcec94c6b086eb7c/FLAGa75cc2663 [2018-11-10 09:25:22,109 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b02764ca-8242-4c1c-9a1d-0a46326013ce/bin-2019/uautomizer/data/47b046f56/811de74aff874f13bcec94c6b086eb7c [2018-11-10 09:25:22,111 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:25:22,112 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:25:22,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:25:22,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:25:22,115 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:25:22,115 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:25:22" (1/1) ... [2018-11-10 09:25:22,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10e4f871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:22, skipping insertion in model container [2018-11-10 09:25:22,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:25:22" (1/1) ... [2018-11-10 09:25:22,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:25:22,135 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:25:22,228 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:25:22,235 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:25:22,244 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:25:22,252 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:25:22,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:22 WrapperNode [2018-11-10 09:25:22,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:25:22,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:25:22,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:25:22,253 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:25:22,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:22" (1/1) ... [2018-11-10 09:25:22,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:22" (1/1) ... [2018-11-10 09:25:22,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:25:22,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:25:22,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:25:22,282 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:25:22,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:22" (1/1) ... [2018-11-10 09:25:22,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:22" (1/1) ... [2018-11-10 09:25:22,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:22" (1/1) ... [2018-11-10 09:25:22,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:22" (1/1) ... [2018-11-10 09:25:22,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:22" (1/1) ... [2018-11-10 09:25:22,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:22" (1/1) ... [2018-11-10 09:25:22,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:22" (1/1) ... [2018-11-10 09:25:22,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:25:22,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:25:22,298 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:25:22,298 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:25:22,298 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b02764ca-8242-4c1c-9a1d-0a46326013ce/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:25:22,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 09:25:22,375 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-11-10 09:25:22,375 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-11-10 09:25:22,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:25:22,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:25:22,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 09:25:22,551 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:25:22,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:25:22 BoogieIcfgContainer [2018-11-10 09:25:22,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:25:22,552 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 09:25:22,552 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 09:25:22,556 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 09:25:22,556 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:25:22,557 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 09:25:22" (1/3) ... [2018-11-10 09:25:22,557 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16c7ebd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:25:22, skipping insertion in model container [2018-11-10 09:25:22,558 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:25:22,558 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:25:22" (2/3) ... [2018-11-10 09:25:22,558 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16c7ebd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:25:22, skipping insertion in model container [2018-11-10 09:25:22,558 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:25:22,558 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:25:22" (3/3) ... [2018-11-10 09:25:22,559 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex2_true-termination.c.i [2018-11-10 09:25:22,604 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 09:25:22,605 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 09:25:22,605 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 09:25:22,605 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 09:25:22,605 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:25:22,605 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:25:22,605 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 09:25:22,605 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:25:22,605 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 09:25:22,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-10 09:25:22,635 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 09:25:22,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:25:22,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:25:22,641 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 09:25:22,641 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:25:22,641 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 09:25:22,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2018-11-10 09:25:22,644 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 09:25:22,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:25:22,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:25:22,644 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 09:25:22,644 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:25:22,649 INFO L793 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 26#L22true SUMMARY for call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L22 24#L22-1true havoc main_#t~nondet8; 21#L23-4true [2018-11-10 09:25:22,650 INFO L795 eck$LassoCheckResult]: Loop: 21#L23-4true assume true; 10#L23-1true SUMMARY for call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L23-1 8#L23-2true assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset; 15#L25true SUMMARY for call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L25 13#L25-1true SUMMARY for call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4); srcloc: L25-1 12#L25-2true havoc main_#t~mem11; 16#L26true SUMMARY for call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L26 32#L26-1true call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 18#recENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 7#L9true SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 9#L9-1true assume #t~mem1 < 0;havoc #t~mem1; 31#L10true SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 4); srcloc: L10 23#L10-1true ~pv~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p.base, ~p.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~up.base, ~up.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~pv~0; 29#recFINALtrue assume true; 27#recEXITtrue >#46#return; 30#L26-2true SUMMARY for call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L26-2 28#L26-3true havoc main_#t~ret12;havoc main_#t~mem13; 21#L23-4true [2018-11-10 09:25:22,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:22,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1387300, now seen corresponding path program 1 times [2018-11-10 09:25:22,656 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:22,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:22,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:22,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:25:22,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:22,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:22,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1231876427, now seen corresponding path program 1 times [2018-11-10 09:25:22,735 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:22,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:22,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:22,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:25:22,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:22,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:25:22,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:25:22,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 09:25:22,937 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:25:22,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 09:25:22,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-10 09:25:22,951 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 11 states. [2018-11-10 09:25:23,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:25:23,136 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-10 09:25:23,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 09:25:23,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2018-11-10 09:25:23,140 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 09:25:23,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 29 states and 31 transitions. [2018-11-10 09:25:23,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-10 09:25:23,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-10 09:25:23,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 31 transitions. [2018-11-10 09:25:23,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 09:25:23,148 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-10 09:25:23,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 31 transitions. [2018-11-10 09:25:23,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-10 09:25:23,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 09:25:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-10 09:25:23,167 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-10 09:25:23,167 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-10 09:25:23,167 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 09:25:23,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 31 transitions. [2018-11-10 09:25:23,168 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 09:25:23,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:25:23,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:25:23,169 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 09:25:23,169 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:25:23,170 INFO L793 eck$LassoCheckResult]: Stem: 113#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 96#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 97#L22 SUMMARY for call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L22 112#L22-1 havoc main_#t~nondet8; 109#L23-4 [2018-11-10 09:25:23,170 INFO L795 eck$LassoCheckResult]: Loop: 109#L23-4 assume true; 102#L23-1 SUMMARY for call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L23-1 98#L23-2 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset; 99#L25 SUMMARY for call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L25 105#L25-1 SUMMARY for call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4); srcloc: L25-1 103#L25-2 havoc main_#t~mem11; 104#L26 SUMMARY for call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L26 90#L26-1 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 91#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 94#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 95#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset; 101#L16 SUMMARY for call #t~mem4 := read~int(~p.base, ~p.offset, 4); srcloc: L16 108#L16-1 #t~post5 := #t~mem4; 106#L16-2 SUMMARY for call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4); srcloc: L16-2 107#L16-3 havoc #t~mem4;havoc #t~post5; 89#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 91#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 94#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 95#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 100#L10 SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 4); srcloc: L10 110#L10-1 ~pv~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p.base, ~p.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~up.base, ~up.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~pv~0; 111#recFINAL assume true; 114#recEXIT >#44#return; 92#L17-1 #res := #t~ret6;havoc #t~ret6; 93#recFINAL assume true; 117#recEXIT >#46#return; 116#L26-2 SUMMARY for call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L26-2 115#L26-3 havoc main_#t~ret12;havoc main_#t~mem13; 109#L23-4 [2018-11-10 09:25:23,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:23,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1387300, now seen corresponding path program 2 times [2018-11-10 09:25:23,170 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:23,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:23,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:23,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:25:23,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:23,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:23,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1764397697, now seen corresponding path program 1 times [2018-11-10 09:25:23,184 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:23,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:23,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:23,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:25:23,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:23,371 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:25:23,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:25:23,372 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b02764ca-8242-4c1c-9a1d-0a46326013ce/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:25:23,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:25:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:23,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:23,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 36 [2018-11-10 09:25:23,533 INFO L477 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 2 case distinctions, treesize of input 22 treesize of output 28 [2018-11-10 09:25:23,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 09:25:23,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-10 09:25:23,561 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 09:25:23,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:23,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 09:25:23,579 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:19 [2018-11-10 09:25:23,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 09:25:23,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:25:23,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 24 [2018-11-10 09:25:23,829 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:25:23,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 09:25:23,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=465, Unknown=8, NotChecked=0, Total=552 [2018-11-10 09:25:23,830 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. cyclomatic complexity: 4 Second operand 24 states. [2018-11-10 09:25:25,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:25:25,660 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-10 09:25:25,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 09:25:25,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2018-11-10 09:25:25,662 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 09:25:25,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 34 transitions. [2018-11-10 09:25:25,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-10 09:25:25,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-10 09:25:25,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 34 transitions. [2018-11-10 09:25:25,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 09:25:25,664 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-10 09:25:25,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 34 transitions. [2018-11-10 09:25:25,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-10 09:25:25,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-10 09:25:25,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-10 09:25:25,666 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-10 09:25:25,666 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-10 09:25:25,666 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 09:25:25,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 34 transitions. [2018-11-10 09:25:25,667 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 09:25:25,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:25:25,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:25:25,668 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 09:25:25,668 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:25:25,669 INFO L793 eck$LassoCheckResult]: Stem: 294#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 275#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 276#L22 SUMMARY for call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L22 293#L22-1 havoc main_#t~nondet8; 290#L23-4 [2018-11-10 09:25:25,669 INFO L795 eck$LassoCheckResult]: Loop: 290#L23-4 assume true; 283#L23-1 SUMMARY for call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L23-1 279#L23-2 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset; 280#L25 SUMMARY for call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L25 286#L25-1 SUMMARY for call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4); srcloc: L25-1 284#L25-2 havoc main_#t~mem11; 285#L26 SUMMARY for call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L26 271#L26-1 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 272#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 277#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 278#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset; 282#L16 SUMMARY for call #t~mem4 := read~int(~p.base, ~p.offset, 4); srcloc: L16 289#L16-1 #t~post5 := #t~mem4; 287#L16-2 SUMMARY for call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4); srcloc: L16-2 288#L16-3 havoc #t~mem4;havoc #t~post5; 270#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 272#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 277#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 278#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset; 282#L16 SUMMARY for call #t~mem4 := read~int(~p.base, ~p.offset, 4); srcloc: L16 289#L16-1 #t~post5 := #t~mem4; 287#L16-2 SUMMARY for call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4); srcloc: L16-2 288#L16-3 havoc #t~mem4;havoc #t~post5; 270#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 272#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 277#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 278#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 281#L10 SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 4); srcloc: L10 291#L10-1 ~pv~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p.base, ~p.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~up.base, ~up.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~pv~0; 292#recFINAL assume true; 295#recEXIT >#44#return; 273#L17-1 #res := #t~ret6;havoc #t~ret6; 274#recFINAL assume true; 301#recEXIT >#44#return; 299#L17-1 #res := #t~ret6;havoc #t~ret6; 300#recFINAL assume true; 298#recEXIT >#46#return; 297#L26-2 SUMMARY for call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L26-2 296#L26-3 havoc main_#t~ret12;havoc main_#t~mem13; 290#L23-4 [2018-11-10 09:25:25,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:25,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1387300, now seen corresponding path program 3 times [2018-11-10 09:25:25,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:25,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:25,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:25,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:25:25,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:25,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:25,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1520146319, now seen corresponding path program 2 times [2018-11-10 09:25:25,680 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:25,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:25,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:25,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:25:25,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:25,910 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 09:25:25,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:25:25,911 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b02764ca-8242-4c1c-9a1d-0a46326013ce/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-11-10 09:25:25,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:25:25,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:25:25,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:25:25,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:25,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 36 [2018-11-10 09:25:26,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-10 09:25:26,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:25:26,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:26,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 09:25:26,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:22 [2018-11-10 09:25:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 09:25:26,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:25:26,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 28 [2018-11-10 09:25:26,215 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:25:26,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-10 09:25:26,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=648, Unknown=11, NotChecked=0, Total=756 [2018-11-10 09:25:26,216 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. cyclomatic complexity: 4 Second operand 28 states. [2018-11-10 09:25:26,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:25:26,461 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-10 09:25:26,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 09:25:26,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2018-11-10 09:25:26,462 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 09:25:26,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 37 transitions. [2018-11-10 09:25:26,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-10 09:25:26,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-11-10 09:25:26,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 37 transitions. [2018-11-10 09:25:26,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 09:25:26,463 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-10 09:25:26,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 37 transitions. [2018-11-10 09:25:26,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-10 09:25:26,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-10 09:25:26,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-11-10 09:25:26,465 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-10 09:25:26,465 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-11-10 09:25:26,465 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 09:25:26,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 37 transitions. [2018-11-10 09:25:26,465 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-10 09:25:26,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:25:26,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:25:26,467 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 09:25:26,467 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:25:26,467 INFO L793 eck$LassoCheckResult]: Stem: 518#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 499#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 500#L22 SUMMARY for call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L22 517#L22-1 havoc main_#t~nondet8; 514#L23-4 [2018-11-10 09:25:26,467 INFO L795 eck$LassoCheckResult]: Loop: 514#L23-4 assume true; 507#L23-1 SUMMARY for call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L23-1 503#L23-2 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset; 504#L25 SUMMARY for call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L25 510#L25-1 SUMMARY for call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4); srcloc: L25-1 508#L25-2 havoc main_#t~mem11; 509#L26 SUMMARY for call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L26 495#L26-1 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 496#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 501#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 502#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset; 506#L16 SUMMARY for call #t~mem4 := read~int(~p.base, ~p.offset, 4); srcloc: L16 513#L16-1 #t~post5 := #t~mem4; 511#L16-2 SUMMARY for call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4); srcloc: L16-2 512#L16-3 havoc #t~mem4;havoc #t~post5; 494#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 496#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 501#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 502#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset; 506#L16 SUMMARY for call #t~mem4 := read~int(~p.base, ~p.offset, 4); srcloc: L16 513#L16-1 #t~post5 := #t~mem4; 511#L16-2 SUMMARY for call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4); srcloc: L16-2 512#L16-3 havoc #t~mem4;havoc #t~post5; 494#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 496#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 501#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 502#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset; 506#L16 SUMMARY for call #t~mem4 := read~int(~p.base, ~p.offset, 4); srcloc: L16 513#L16-1 #t~post5 := #t~mem4; 511#L16-2 SUMMARY for call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4); srcloc: L16-2 512#L16-3 havoc #t~mem4;havoc #t~post5; 494#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 496#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 501#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 502#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 505#L10 SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 4); srcloc: L10 515#L10-1 ~pv~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p.base, ~p.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~up.base, ~up.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~pv~0; 516#recFINAL assume true; 519#recEXIT >#44#return; 497#L17-1 #res := #t~ret6;havoc #t~ret6; 498#recFINAL assume true; 528#recEXIT >#44#return; 527#L17-1 #res := #t~ret6;havoc #t~ret6; 526#recFINAL assume true; 525#recEXIT >#44#return; 523#L17-1 #res := #t~ret6;havoc #t~ret6; 524#recFINAL assume true; 522#recEXIT >#46#return; 521#L26-2 SUMMARY for call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L26-2 520#L26-3 havoc main_#t~ret12;havoc main_#t~mem13; 514#L23-4 [2018-11-10 09:25:26,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:26,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1387300, now seen corresponding path program 4 times [2018-11-10 09:25:26,467 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:26,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:26,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:26,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:25:26,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:26,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:26,475 INFO L82 PathProgramCache]: Analyzing trace with hash -201151963, now seen corresponding path program 3 times [2018-11-10 09:25:26,475 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:26,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:26,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:26,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:25:26,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:26,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:26,538 INFO L82 PathProgramCache]: Analyzing trace with hash -19126648, now seen corresponding path program 1 times [2018-11-10 09:25:26,538 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:26,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:26,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:26,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:25:26,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:26,907 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 115 [2018-11-10 09:25:27,339 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 134 [2018-11-10 09:25:27,806 WARN L179 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 142 [2018-11-10 09:25:28,427 WARN L179 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 147 [2018-11-10 09:25:28,547 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-11-10 09:25:28,619 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:25:28,620 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:25:28,620 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:25:28,620 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:25:28,620 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:25:28,620 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:25:28,620 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:25:28,621 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:25:28,621 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2_true-termination.c.i_Iteration4_Lasso [2018-11-10 09:25:28,621 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:25:28,621 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:25:28,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:28,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:28,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:28,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:28,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:28,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:28,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:28,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:28,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:29,064 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:25:29,068 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:25:29,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:29,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:29,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:29,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:29,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:29,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:29,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:29,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:29,074 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:29,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:29,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:29,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:29,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:29,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:29,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:29,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:29,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:29,076 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:29,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:29,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:29,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:29,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:29,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:29,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:29,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:29,084 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:29,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:29,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:29,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:29,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:29,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:29,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:29,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:29,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:29,086 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:29,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:29,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:29,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:29,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:29,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:29,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:29,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:29,094 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:29,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:29,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:29,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:29,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:29,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:29,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:29,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:29,110 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:25:29,118 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:25:29,118 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 09:25:29,120 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:25:29,121 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 09:25:29,121 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:25:29,121 INFO L519 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-11-10 09:25:29,152 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-10 09:25:29,155 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:25:29,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:29,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:29,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:29,232 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:25:29,233 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:25:29,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 09:25:29,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 09:25:29,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:29,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-11-10 09:25:29,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-10 09:25:29,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:25:29,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:25:29,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:29,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:29,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-11-10 09:25:29,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-10 09:25:29,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-10 09:25:29,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:25:29,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:29,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:29,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2018-11-10 09:25:29,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 40 [2018-11-10 09:25:29,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-11-10 09:25:29,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:25:29,429 INFO L477 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 2 case distinctions, treesize of input 26 treesize of output 32 [2018-11-10 09:25:29,430 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 09:25:29,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 09:25:29,459 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 2 xjuncts. [2018-11-10 09:25:29,460 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:36, output treesize:40 [2018-11-10 09:25:29,479 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 09:25:29,481 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2018-11-10 09:25:29,482 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 37 transitions. cyclomatic complexity: 4 Second operand 15 states. [2018-11-10 09:25:29,660 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 37 transitions. cyclomatic complexity: 4. Second operand 15 states. Result 109 states and 116 transitions. Complement of second has 40 states. [2018-11-10 09:25:29,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2018-11-10 09:25:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-10 09:25:29,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 32 transitions. [2018-11-10 09:25:29,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 32 transitions. Stem has 4 letters. Loop has 50 letters. [2018-11-10 09:25:29,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:29,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 32 transitions. Stem has 54 letters. Loop has 50 letters. [2018-11-10 09:25:29,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:29,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 32 transitions. Stem has 4 letters. Loop has 100 letters. [2018-11-10 09:25:29,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:29,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 116 transitions. [2018-11-10 09:25:29,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 09:25:29,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 72 states and 77 transitions. [2018-11-10 09:25:29,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-10 09:25:29,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-10 09:25:29,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 77 transitions. [2018-11-10 09:25:29,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:25:29,671 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-11-10 09:25:29,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 77 transitions. [2018-11-10 09:25:29,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2018-11-10 09:25:29,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-10 09:25:29,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-10 09:25:29,675 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-10 09:25:29,675 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-10 09:25:29,675 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 09:25:29,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 64 transitions. [2018-11-10 09:25:29,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 09:25:29,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:25:29,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:25:29,676 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:25:29,676 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:25:29,677 INFO L793 eck$LassoCheckResult]: Stem: 932#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 902#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 903#L22 SUMMARY for call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L22 930#L22-1 havoc main_#t~nondet8; 931#L23-4 assume true; 910#L23-1 SUMMARY for call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L23-1 904#L23-2 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset; 905#L25 SUMMARY for call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L25 916#L25-1 SUMMARY for call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4); srcloc: L25-1 912#L25-2 havoc main_#t~mem11; 913#L26 SUMMARY for call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L26 891#L26-1 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 890#recENTRY [2018-11-10 09:25:29,677 INFO L795 eck$LassoCheckResult]: Loop: 890#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 897#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 898#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset; 908#L16 SUMMARY for call #t~mem4 := read~int(~p.base, ~p.offset, 4); srcloc: L16 923#L16-1 #t~post5 := #t~mem4; 918#L16-2 SUMMARY for call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4); srcloc: L16-2 919#L16-3 havoc #t~mem4;havoc #t~post5; 889#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 890#recENTRY [2018-11-10 09:25:29,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:29,677 INFO L82 PathProgramCache]: Analyzing trace with hash 671473619, now seen corresponding path program 1 times [2018-11-10 09:25:29,677 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:29,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:29,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:29,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:25:29,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:29,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:29,689 INFO L82 PathProgramCache]: Analyzing trace with hash -711880444, now seen corresponding path program 1 times [2018-11-10 09:25:29,689 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:29,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:29,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:29,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:25:29,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:29,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:29,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1701543638, now seen corresponding path program 1 times [2018-11-10 09:25:29,700 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:29,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:29,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:29,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:25:29,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:29,839 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2018-11-10 09:25:30,118 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 107 [2018-11-10 09:25:30,270 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:25:30,271 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:25:30,271 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:25:30,271 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:25:30,271 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:25:30,271 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:25:30,271 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:25:30,271 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:25:30,271 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2_true-termination.c.i_Iteration5_Lasso [2018-11-10 09:25:30,271 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:25:30,271 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:25:30,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,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-11-10 09:25:30,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-11-10 09:25:30,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:30,647 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:25:30,647 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:25:30,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:30,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:30,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:30,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:30,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:30,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:30,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:30,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:30,650 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:30,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:30,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:30,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:30,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:30,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:30,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:30,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:30,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:30,652 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:30,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:30,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:30,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:30,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:30,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:30,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:30,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:30,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:30,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:30,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:30,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:30,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:30,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:30,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:30,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:30,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:30,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:30,655 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:30,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:30,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:30,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:30,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:30,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:30,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:30,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:30,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:30,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:30,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:30,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:30,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:30,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:30,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:30,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:30,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:30,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:30,658 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:30,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:30,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:30,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:30,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:30,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:30,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:30,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:30,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:30,660 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:30,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:30,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:30,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:30,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:30,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:30,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:30,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:30,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:30,661 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:30,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:30,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:30,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:30,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:30,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:30,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:30,662 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:30,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:30,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:30,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:30,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:30,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:30,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:30,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:30,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:30,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:30,663 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:30,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:30,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:30,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:30,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:30,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:30,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:30,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:30,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:30,665 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:30,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:30,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:30,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:30,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:30,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:30,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:30,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:30,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:30,666 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:30,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:30,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:30,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:30,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:30,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:30,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:30,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:30,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:30,667 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:30,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:30,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:30,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:30,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:30,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:30,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:30,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:30,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:30,668 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:30,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:30,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:30,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:30,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:30,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:30,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:30,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:30,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:30,669 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:30,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:30,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:30,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:30,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:30,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:30,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:30,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:30,677 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:30,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:30,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:30,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:30,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:30,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:30,678 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:30,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:30,684 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:25:30,688 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:25:30,688 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 09:25:30,688 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:25:30,689 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 09:25:30,689 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:25:30,689 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_1 + 1 Supporting invariants [] [2018-11-10 09:25:30,700 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 09:25:30,702 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:25:30,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:30,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:30,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:30,808 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:25:30,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-11-10 09:25:30,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-10 09:25:30,814 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:25:30,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:25:30,829 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-11-10 09:25:30,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-11-10 09:25:30,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:25:30,846 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-10 09:25:30,846 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 64 transitions. cyclomatic complexity: 7 Second operand 8 states. [2018-11-10 09:25:31,015 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 64 transitions. cyclomatic complexity: 7. Second operand 8 states. Result 148 states and 156 transitions. Complement of second has 30 states. [2018-11-10 09:25:31,017 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-11-10 09:25:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 09:25:31,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 27 transitions. [2018-11-10 09:25:31,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 27 transitions. Stem has 12 letters. Loop has 8 letters. [2018-11-10 09:25:31,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:31,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 27 transitions. Stem has 20 letters. Loop has 8 letters. [2018-11-10 09:25:31,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:31,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 27 transitions. Stem has 12 letters. Loop has 16 letters. [2018-11-10 09:25:31,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:31,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 156 transitions. [2018-11-10 09:25:31,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 09:25:31,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 92 states and 99 transitions. [2018-11-10 09:25:31,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 09:25:31,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 09:25:31,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 99 transitions. [2018-11-10 09:25:31,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:25:31,023 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 99 transitions. [2018-11-10 09:25:31,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 99 transitions. [2018-11-10 09:25:31,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-10 09:25:31,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-10 09:25:31,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2018-11-10 09:25:31,029 INFO L728 BuchiCegarLoop]: Abstraction has 92 states and 99 transitions. [2018-11-10 09:25:31,030 INFO L608 BuchiCegarLoop]: Abstraction has 92 states and 99 transitions. [2018-11-10 09:25:31,030 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 09:25:31,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 99 transitions. [2018-11-10 09:25:31,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 09:25:31,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:25:31,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:25:31,032 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:25:31,032 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:25:31,032 INFO L793 eck$LassoCheckResult]: Stem: 1276#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1242#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 1243#L22 SUMMARY for call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L22 1275#L22-1 havoc main_#t~nondet8; 1270#L23-4 assume true; 1256#L23-1 SUMMARY for call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L23-1 1251#L23-2 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset; 1252#L25 SUMMARY for call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L25 1262#L25-1 SUMMARY for call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4); srcloc: L25-1 1259#L25-2 havoc main_#t~mem11; 1260#L26 SUMMARY for call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L26 1247#L26-1 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 1267#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 1246#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 1248#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset; 1254#L16 SUMMARY for call #t~mem4 := read~int(~p.base, ~p.offset, 4); srcloc: L16 1269#L16-1 #t~post5 := #t~mem4; 1265#L16-2 SUMMARY for call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4); srcloc: L16-2 1266#L16-3 havoc #t~mem4;havoc #t~post5; 1239#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1295#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 1297#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 1302#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset; 1299#L16 SUMMARY for call #t~mem4 := read~int(~p.base, ~p.offset, 4); srcloc: L16 1298#L16-1 #t~post5 := #t~mem4; 1294#L16-2 SUMMARY for call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4); srcloc: L16-2 1293#L16-3 havoc #t~mem4;havoc #t~post5; 1240#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1295#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 1297#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 1302#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset; 1299#L16 SUMMARY for call #t~mem4 := read~int(~p.base, ~p.offset, 4); srcloc: L16 1298#L16-1 #t~post5 := #t~mem4; 1294#L16-2 SUMMARY for call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4); srcloc: L16-2 1293#L16-3 havoc #t~mem4;havoc #t~post5; 1240#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1295#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 1296#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 1290#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 1281#L10 SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 4); srcloc: L10 1273#L10-1 ~pv~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p.base, ~p.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~up.base, ~up.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~pv~0; 1274#recFINAL assume true; 1277#recEXIT >#44#return; 1238#L17-1 #res := #t~ret6;havoc #t~ret6; 1241#recFINAL assume true; 1289#recEXIT >#44#return; 1287#L17-1 #res := #t~ret6;havoc #t~ret6; 1288#recFINAL assume true; 1286#recEXIT >#44#return; 1285#L17-1 #res := #t~ret6;havoc #t~ret6; 1284#recFINAL assume true; 1282#recEXIT >#46#return; 1280#L26-2 SUMMARY for call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L26-2 1278#L26-3 havoc main_#t~ret12;havoc main_#t~mem13; 1279#L23-4 assume true; 1255#L23-1 SUMMARY for call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L23-1 1249#L23-2 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset; 1250#L25 SUMMARY for call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L25 1261#L25-1 SUMMARY for call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4); srcloc: L25-1 1257#L25-2 havoc main_#t~mem11; 1258#L26 SUMMARY for call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L26 1233#L26-1 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 1234#recENTRY [2018-11-10 09:25:31,034 INFO L795 eck$LassoCheckResult]: Loop: 1234#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 1244#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 1245#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset; 1253#L16 SUMMARY for call #t~mem4 := read~int(~p.base, ~p.offset, 4); srcloc: L16 1268#L16-1 #t~post5 := #t~mem4; 1263#L16-2 SUMMARY for call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4); srcloc: L16-2 1264#L16-3 havoc #t~mem4;havoc #t~post5; 1232#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1234#recENTRY [2018-11-10 09:25:31,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:31,034 INFO L82 PathProgramCache]: Analyzing trace with hash 73217847, now seen corresponding path program 2 times [2018-11-10 09:25:31,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:31,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:31,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:31,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:25:31,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:31,404 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 09:25:31,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:25:31,405 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b02764ca-8242-4c1c-9a1d-0a46326013ce/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-11-10 09:25:31,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:25:31,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:25:31,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:25:31,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:31,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-10 09:25:31,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 09:25:31,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:31,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-10 09:25:31,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:25:31,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:25:31,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:25:31,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:31,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:31,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 09:25:31,483 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:25:31,484 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:25:31,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-10 09:25:31,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 09:25:31,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:31,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-10 09:25:31,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-10 09:25:31,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:25:31,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:25:31,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:31,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:31,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-11-10 09:25:31,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 38 [2018-11-10 09:25:31,912 INFO L477 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 27 treesize of output 22 [2018-11-10 09:25:31,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:25:31,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:31,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 09:25:31,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:43 [2018-11-10 09:25:31,961 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:25:31,962 INFO L477 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 52 treesize of output 57 [2018-11-10 09:25:31,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-11-10 09:25:31,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 09:25:31,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:25:31,991 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-11-10 09:25:31,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:56, output treesize:31 [2018-11-10 09:25:32,031 INFO L477 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 34 treesize of output 30 [2018-11-10 09:25:32,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-10 09:25:32,034 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:25:32,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 09:25:32,040 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 09:25:32,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:25:32,046 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-11-10 09:25:32,046 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:38, output treesize:15 [2018-11-10 09:25:32,080 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-10 09:25:32,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:25:32,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25] total 43 [2018-11-10 09:25:32,097 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:25:32,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:32,098 INFO L82 PathProgramCache]: Analyzing trace with hash -711880444, now seen corresponding path program 2 times [2018-11-10 09:25:32,098 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:32,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:32,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:32,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:25:32,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:32,209 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2018-11-10 09:25:32,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-10 09:25:32,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1637, Unknown=9, NotChecked=0, Total=1806 [2018-11-10 09:25:32,340 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. cyclomatic complexity: 11 Second operand 43 states. [2018-11-10 09:25:32,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:25:32,782 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2018-11-10 09:25:32,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-10 09:25:32,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 122 transitions. [2018-11-10 09:25:32,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 09:25:32,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 98 states and 109 transitions. [2018-11-10 09:25:32,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 09:25:32,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 09:25:32,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 109 transitions. [2018-11-10 09:25:32,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:25:32,785 INFO L705 BuchiCegarLoop]: Abstraction has 98 states and 109 transitions. [2018-11-10 09:25:32,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 109 transitions. [2018-11-10 09:25:32,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2018-11-10 09:25:32,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-10 09:25:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-11-10 09:25:32,792 INFO L728 BuchiCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-11-10 09:25:32,792 INFO L608 BuchiCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-11-10 09:25:32,792 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 09:25:32,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 103 transitions. [2018-11-10 09:25:32,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 09:25:32,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:25:32,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:25:32,794 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:25:32,794 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:25:32,794 INFO L793 eck$LassoCheckResult]: Stem: 1738#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1702#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~ip~0.base, main_~ip~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset; 1703#L22 SUMMARY for call write~int(main_#t~nondet8, main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L22 1737#L22-1 havoc main_#t~nondet8; 1732#L23-4 assume true; 1733#L23-1 SUMMARY for call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L23-1 1786#L23-2 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset; 1785#L25 SUMMARY for call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L25 1784#L25-1 SUMMARY for call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4); srcloc: L25-1 1783#L25-2 havoc main_#t~mem11; 1782#L26 SUMMARY for call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L26 1745#L26-1 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 1781#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 1780#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 1779#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset; 1778#L16 SUMMARY for call #t~mem4 := read~int(~p.base, ~p.offset, 4); srcloc: L16 1777#L16-1 #t~post5 := #t~mem4; 1776#L16-2 SUMMARY for call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4); srcloc: L16-2 1775#L16-3 havoc #t~mem4;havoc #t~post5; 1699#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1765#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 1764#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 1714#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset; 1715#L16 SUMMARY for call #t~mem4 := read~int(~p.base, ~p.offset, 4); srcloc: L16 1731#L16-1 #t~post5 := #t~mem4; 1726#L16-2 SUMMARY for call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4); srcloc: L16-2 1727#L16-3 havoc #t~mem4;havoc #t~post5; 1700#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1765#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 1764#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 1714#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset; 1715#L16 SUMMARY for call #t~mem4 := read~int(~p.base, ~p.offset, 4); srcloc: L16 1731#L16-1 #t~post5 := #t~mem4; 1726#L16-2 SUMMARY for call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4); srcloc: L16-2 1727#L16-3 havoc #t~mem4;havoc #t~post5; 1700#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1765#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 1764#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 1714#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset; 1715#L16 SUMMARY for call #t~mem4 := read~int(~p.base, ~p.offset, 4); srcloc: L16 1731#L16-1 #t~post5 := #t~mem4; 1726#L16-2 SUMMARY for call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4); srcloc: L16-2 1727#L16-3 havoc #t~mem4;havoc #t~post5; 1700#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1765#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 1751#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 1750#L9-1 assume #t~mem1 < 0;havoc #t~mem1; 1743#L10 SUMMARY for call #t~mem2 := read~int(~p.base, ~p.offset, 4); srcloc: L10 1735#L10-1 ~pv~0 := #t~mem2;havoc #t~mem2;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~p.base, ~p.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_old_#valid := #valid;assume { :begin_inline_ULTIMATE.dealloc } true;ULTIMATE.dealloc_~addr.base, ULTIMATE.dealloc_~addr.offset := ~up.base, ~up.offset;havoc #valid;assume #valid == ULTIMATE.dealloc_old_#valid[ULTIMATE.dealloc_~addr.base := 0];assume { :end_inline_ULTIMATE.dealloc } true;#res := ~pv~0; 1736#recFINAL assume true; 1739#recEXIT >#44#return; 1698#L17-1 #res := #t~ret6;havoc #t~ret6; 1701#recFINAL assume true; 1760#recEXIT >#44#return; 1759#L17-1 #res := #t~ret6;havoc #t~ret6; 1758#recFINAL assume true; 1757#recEXIT >#44#return; 1749#L17-1 #res := #t~ret6;havoc #t~ret6; 1755#recFINAL assume true; 1748#recEXIT >#44#return; 1747#L17-1 #res := #t~ret6;havoc #t~ret6; 1746#recFINAL assume true; 1744#recEXIT >#46#return; 1742#L26-2 SUMMARY for call write~int(main_#t~mem13 + main_#t~ret12, main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L26-2 1740#L26-3 havoc main_#t~ret12;havoc main_#t~mem13; 1741#L23-4 assume true; 1716#L23-1 SUMMARY for call main_#t~mem9 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L23-1 1709#L23-2 assume !!(main_#t~mem9 > 1);havoc main_#t~mem9;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~op~0.base, main_~op~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset; 1710#L25 SUMMARY for call main_#t~mem11 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L25 1722#L25-1 SUMMARY for call write~int(main_#t~mem11, main_~op~0.base, main_~op~0.offset, 4); srcloc: L25-1 1718#L25-2 havoc main_#t~mem11; 1719#L26 SUMMARY for call main_#t~mem13 := read~int(main_~ip~0.base, main_~ip~0.offset, 4); srcloc: L26 1693#L26-1 call main_#t~ret12 := rec(main_~op~0.base, main_~op~0.offset, main_~ip~0.base, main_~ip~0.offset);< 1694#recENTRY [2018-11-10 09:25:32,794 INFO L795 eck$LassoCheckResult]: Loop: 1694#recENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;~up.base, ~up.offset := #in~up.base, #in~up.offset; 1704#L9 SUMMARY for call #t~mem1 := read~int(~p.base, ~p.offset, 4); srcloc: L9 1705#L9-1 assume !(#t~mem1 < 0);havoc #t~mem1;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];#t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;~upn~0.base, ~upn~0.offset := #t~malloc3.base, #t~malloc3.offset; 1713#L16 SUMMARY for call #t~mem4 := read~int(~p.base, ~p.offset, 4); srcloc: L16 1730#L16-1 #t~post5 := #t~mem4; 1724#L16-2 SUMMARY for call write~int(#t~post5 - 1, ~p.base, ~p.offset, 4); srcloc: L16-2 1725#L16-3 havoc #t~mem4;havoc #t~post5; 1692#L17 call #t~ret6 := rec(~p.base, ~p.offset, ~upn~0.base, ~upn~0.offset);< 1694#recENTRY [2018-11-10 09:25:32,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:32,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1774671829, now seen corresponding path program 3 times [2018-11-10 09:25:32,794 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:32,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:32,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:32,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:25:32,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:32,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:32,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:32,844 INFO L82 PathProgramCache]: Analyzing trace with hash -711880444, now seen corresponding path program 3 times [2018-11-10 09:25:32,844 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:32,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:32,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:32,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:25:32,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:32,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:32,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1833052968, now seen corresponding path program 4 times [2018-11-10 09:25:32,854 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:25:32,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:25:32,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:32,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:25:32,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:25:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:25:33,039 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2018-11-10 09:25:33,420 WARN L179 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 115 [2018-11-10 09:25:33,785 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 134 [2018-11-10 09:25:34,263 WARN L179 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 142 [2018-11-10 09:25:34,743 WARN L179 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 150 [2018-11-10 09:25:36,302 WARN L179 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 278 DAG size of output: 248 [2018-11-10 09:25:36,550 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2018-11-10 09:25:36,811 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2018-11-10 09:25:36,954 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-11-10 09:25:36,957 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:25:36,957 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:25:36,957 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:25:36,957 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:25:36,957 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:25:36,957 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:25:36,957 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:25:36,957 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:25:36,957 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex2_true-termination.c.i_Iteration7_Lasso [2018-11-10 09:25:36,957 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:25:36,957 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:25:36,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:36,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:36,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:36,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:36,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:36,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:36,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:36,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:36,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:36,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:36,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:36,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:36,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:36,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:36,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:36,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:36,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:36,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:36,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:36,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:36,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:25:37,482 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:25:37,482 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:25:37,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:37,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:37,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:37,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:37,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:37,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:37,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:37,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:37,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:37,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:37,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:37,487 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:37,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:37,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:37,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:37,489 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:37,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:37,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:37,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:37,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:37,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:37,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:37,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:37,491 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:37,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:37,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:37,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:37,492 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:37,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:37,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:37,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:37,493 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:37,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:37,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:37,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:37,494 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:37,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:37,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:37,497 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:37,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:37,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:37,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:37,499 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:37,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:37,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:37,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:37,500 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:37,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:37,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:37,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:37,502 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:37,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:37,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:37,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:37,503 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:37,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:37,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:37,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:37,505 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:37,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:37,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:37,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:37,507 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:37,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:37,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:37,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:37,508 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:37,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:25:37,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:25:37,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:25:37,510 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:37,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:37,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:37,514 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:37,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:37,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:37,518 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:37,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:37,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:37,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:25:37,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:25:37,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:25:37,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:25:37,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:25:37,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:25:37,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:25:37,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:25:37,533 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:25:37,539 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:25:37,539 INFO L444 ModelExtractionUtils]: 17 out of 22 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 09:25:37,540 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:25:37,540 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 09:25:37,540 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:25:37,541 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~p.base) rec_#in~p.offset)_2 + 1 Supporting invariants [] [2018-11-10 09:25:37,608 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-10 09:25:37,609 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:25:37,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:37,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:37,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:37,760 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:25:37,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-11-10 09:25:37,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-10 09:25:37,763 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:25:37,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:25:37,772 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-11-10 09:25:37,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-11-10 09:25:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:25:37,784 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-10 09:25:37,784 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 95 states and 103 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-11-10 09:25:37,922 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 95 states and 103 transitions. cyclomatic complexity: 12. Second operand 9 states. Result 118 states and 126 transitions. Complement of second has 30 states. [2018-11-10 09:25:37,926 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-11-10 09:25:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 09:25:37,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 27 transitions. [2018-11-10 09:25:37,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 27 transitions. Stem has 73 letters. Loop has 8 letters. [2018-11-10 09:25:37,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:37,927 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 09:25:37,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:37,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:38,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:38,067 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:25:38,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-11-10 09:25:38,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-10 09:25:38,070 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:25:38,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:25:38,080 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-11-10 09:25:38,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-11-10 09:25:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:25:38,094 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-10 09:25:38,095 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 95 states and 103 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-11-10 09:25:38,233 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 95 states and 103 transitions. cyclomatic complexity: 12. Second operand 9 states. Result 118 states and 126 transitions. Complement of second has 30 states. [2018-11-10 09:25:38,233 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-11-10 09:25:38,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 09:25:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 27 transitions. [2018-11-10 09:25:38,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 27 transitions. Stem has 73 letters. Loop has 8 letters. [2018-11-10 09:25:38,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:38,234 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 09:25:38,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:25:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:38,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:25:38,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:25:38,365 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:25:38,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-11-10 09:25:38,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-10 09:25:38,368 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:25:38,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:25:38,377 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-11-10 09:25:38,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:20 [2018-11-10 09:25:38,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:25:38,388 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-10 09:25:38,388 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 95 states and 103 transitions. cyclomatic complexity: 12 Second operand 9 states. [2018-11-10 09:25:38,551 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 95 states and 103 transitions. cyclomatic complexity: 12. Second operand 9 states. Result 161 states and 169 transitions. Complement of second has 31 states. [2018-11-10 09:25:38,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-10 09:25:38,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 09:25:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2018-11-10 09:25:38,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 45 transitions. Stem has 73 letters. Loop has 8 letters. [2018-11-10 09:25:38,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:38,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 45 transitions. Stem has 81 letters. Loop has 8 letters. [2018-11-10 09:25:38,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:38,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 45 transitions. Stem has 73 letters. Loop has 16 letters. [2018-11-10 09:25:38,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:25:38,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 169 transitions. [2018-11-10 09:25:38,555 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 09:25:38,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 0 states and 0 transitions. [2018-11-10 09:25:38,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 09:25:38,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 09:25:38,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 09:25:38,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 09:25:38,556 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:25:38,556 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:25:38,556 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:25:38,556 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 09:25:38,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 09:25:38,556 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 09:25:38,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 09:25:38,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 09:25:38 BoogieIcfgContainer [2018-11-10 09:25:38,562 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 09:25:38,562 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:25:38,562 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:25:38,562 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:25:38,563 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:25:22" (3/4) ... [2018-11-10 09:25:38,566 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 09:25:38,566 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:25:38,567 INFO L168 Benchmark]: Toolchain (without parser) took 16454.74 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.1 MB). Free memory was 961.8 MB in the beginning and 1.1 GB in the end (delta: -134.7 MB). Peak memory consumption was 159.4 MB. Max. memory is 11.5 GB. [2018-11-10 09:25:38,567 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:25:38,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.13 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:25:38,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.17 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 948.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:25:38,568 INFO L168 Benchmark]: Boogie Preprocessor took 16.05 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:25:38,568 INFO L168 Benchmark]: RCFGBuilder took 254.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -139.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-10 09:25:38,569 INFO L168 Benchmark]: BuchiAutomizer took 16009.45 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -9.1 MB). Peak memory consumption was 172.3 MB. Max. memory is 11.5 GB. [2018-11-10 09:25:38,569 INFO L168 Benchmark]: Witness Printer took 3.99 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:25:38,571 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 140.13 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.1 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 28.17 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 948.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.05 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 254.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -139.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16009.45 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 181.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -9.1 MB). Peak memory consumption was 172.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.99 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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 14 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 9 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 10 locations. 4 modules have a trivial ranking function, the largest among these consists of 43 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.9s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 11.3s. Construction of modules took 2.3s. Büchi inclusion checks took 2.1s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 15 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 95 states and ocurred in iteration 6. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 48/48 HoareTripleCheckerStatistics: 161 SDtfs, 258 SDslu, 736 SDs, 0 SdLazy, 1515 SolverSat, 127 SolverUnsat, 43 SolverUnknown, 0 SolverNotchecked, 2.3s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital426 mio100 ax100 hnf100 lsp98 ukn48 mio100 lsp29 div100 bol100 ite100 ukn100 eq186 hnf88 smp94 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...