./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11D_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11D_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 570a3560ecb7b29b974852ea58d8cc903e7c487d .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:24:14,480 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:24:14,482 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:24:14,500 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:24:14,501 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:24:14,503 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:24:14,505 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:24:14,509 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:24:14,512 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:24:14,514 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:24:14,517 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:24:14,518 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:24:14,519 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:24:14,522 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:24:14,529 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:24:14,531 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:24:14,535 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:24:14,538 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:24:14,541 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:24:14,545 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:24:14,547 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:24:14,551 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:24:14,557 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:24:14,560 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:24:14,560 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:24:14,561 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:24:14,562 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:24:14,562 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:24:14,568 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:24:14,569 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:24:14,569 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:24:14,572 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:24:14,572 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:24:14,572 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:24:14,575 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:24:14,576 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:24:14,577 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:24:14,602 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:24:14,602 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:24:14,604 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:24:14,604 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:24:14,604 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:24:14,604 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:24:14,604 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:24:14,605 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:24:14,606 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:24:14,606 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:24:14,606 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:24:14,606 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:24:14,606 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:24:14,606 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:24:14,607 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:24:14,607 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:24:14,608 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:24:14,608 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:24:14,608 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:24:14,608 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:24:14,608 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:24:14,608 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:24:14,609 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:24:14,609 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:24:14,609 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:24:14,609 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:24:14,609 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:24:14,609 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:24:14,612 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:24:14,612 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 570a3560ecb7b29b974852ea58d8cc903e7c487d [2018-11-28 23:24:14,682 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:24:14,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:24:14,705 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:24:14,707 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:24:14,707 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:24:14,708 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11D_true-termination.c.i [2018-11-28 23:24:14,780 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d03b9b40/a0c54e8ae61841489eb6821ec0be1157/FLAG7aa4af6e8 [2018-11-28 23:24:15,220 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:24:15,221 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11D_true-termination.c.i [2018-11-28 23:24:15,227 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d03b9b40/a0c54e8ae61841489eb6821ec0be1157/FLAG7aa4af6e8 [2018-11-28 23:24:15,597 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d03b9b40/a0c54e8ae61841489eb6821ec0be1157 [2018-11-28 23:24:15,602 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:24:15,605 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:24:15,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:24:15,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:24:15,611 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:24:15,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:24:15" (1/1) ... [2018-11-28 23:24:15,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57c5a119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:15, skipping insertion in model container [2018-11-28 23:24:15,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:24:15" (1/1) ... [2018-11-28 23:24:15,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:24:15,652 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:24:15,893 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:24:15,915 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:24:15,941 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:24:15,965 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:24:15,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:15 WrapperNode [2018-11-28 23:24:15,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:24:15,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:24:15,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:24:15,967 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:24:15,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:15" (1/1) ... [2018-11-28 23:24:15,992 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:15" (1/1) ... [2018-11-28 23:24:16,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:24:16,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:24:16,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:24:16,021 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:24:16,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:15" (1/1) ... [2018-11-28 23:24:16,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:15" (1/1) ... [2018-11-28 23:24:16,036 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:15" (1/1) ... [2018-11-28 23:24:16,038 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:15" (1/1) ... [2018-11-28 23:24:16,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:15" (1/1) ... [2018-11-28 23:24:16,052 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:15" (1/1) ... [2018-11-28 23:24:16,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:15" (1/1) ... [2018-11-28 23:24:16,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:24:16,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:24:16,063 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:24:16,063 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:24:16,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:24:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:24:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-11-28 23:24:16,219 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-11-28 23:24:16,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:24:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:24:16,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:24:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:24:16,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:24:16,644 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:24:16,644 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 23:24:16,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:16 BoogieIcfgContainer [2018-11-28 23:24:16,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:24:16,646 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:24:16,646 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:24:16,651 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:24:16,652 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:16,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:24:15" (1/3) ... [2018-11-28 23:24:16,654 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c771d8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:24:16, skipping insertion in model container [2018-11-28 23:24:16,654 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:16,654 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:15" (2/3) ... [2018-11-28 23:24:16,655 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c771d8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:24:16, skipping insertion in model container [2018-11-28 23:24:16,655 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:16,655 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:16" (3/3) ... [2018-11-28 23:24:16,658 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11D_true-termination.c.i [2018-11-28 23:24:16,736 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:24:16,737 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:24:16,737 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:24:16,738 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:24:16,738 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:24:16,738 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:24:16,738 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:24:16,738 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:24:16,739 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:24:16,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:24:16,784 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:24:16,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:16,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:16,792 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:24:16,792 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:16,792 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:24:16,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:24:16,795 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:24:16,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:16,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:16,796 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:24:16,796 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:16,803 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 7#L30-3true [2018-11-28 23:24:16,804 INFO L796 eck$LassoCheckResult]: Loop: 7#L30-3true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 10#L30-1true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 17#L34true assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 8#L38true call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 6#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 13#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 18#recFINALtrue assume true; 15#recEXITtrue >#44#return; 5#L38-1true assume -1 == main_#t~ret12;main_#t~ite13 := -1; 20#L38-3true call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ret12;havoc main_#t~ite13; 7#L30-3true [2018-11-28 23:24:16,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:16,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2018-11-28 23:24:16,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:16,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:16,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:16,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:16,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:16,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:16,948 INFO L82 PathProgramCache]: Analyzing trace with hash -2107477180, now seen corresponding path program 1 times [2018-11-28 23:24:16,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:16,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:16,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:16,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:16,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:17,304 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-28 23:24:17,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:24:17,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 23:24:17,311 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:24:17,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:24:17,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:24:17,329 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2018-11-28 23:24:17,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:17,679 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-11-28 23:24:17,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:24:17,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-11-28 23:24:17,684 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:24:17,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 19 transitions. [2018-11-28 23:24:17,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 23:24:17,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 23:24:17,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-11-28 23:24:17,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:17,697 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 23:24:17,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-11-28 23:24:17,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-28 23:24:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 23:24:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-11-28 23:24:17,726 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 23:24:17,726 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 23:24:17,727 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:24:17,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-11-28 23:24:17,728 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:24:17,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:17,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:17,729 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:24:17,729 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:17,729 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 57#L30-3 [2018-11-28 23:24:17,730 INFO L796 eck$LassoCheckResult]: Loop: 57#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 58#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 59#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 52#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 51#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 54#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 53#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 51#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 54#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 63#recFINAL assume true; 65#recEXIT >#42#return; 60#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 61#recFINAL assume true; 66#recEXIT >#44#return; 55#L38-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 56#L38-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ret12;havoc main_#t~ite13; 57#L30-3 [2018-11-28 23:24:17,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:17,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2018-11-28 23:24:17,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:17,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:17,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:17,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:17,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:17,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:17,747 INFO L82 PathProgramCache]: Analyzing trace with hash 290320444, now seen corresponding path program 1 times [2018-11-28 23:24:17,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:17,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:17,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:17,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:17,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:17,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:17,853 INFO L82 PathProgramCache]: Analyzing trace with hash -645910274, now seen corresponding path program 1 times [2018-11-28 23:24:17,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:17,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:17,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:17,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:17,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:18,194 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-28 23:24:18,420 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-28 23:24:19,121 WARN L180 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2018-11-28 23:24:19,399 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-11-28 23:24:19,539 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-11-28 23:24:20,185 WARN L180 SmtUtils]: Spent 634.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2018-11-28 23:24:20,310 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-11-28 23:24:20,443 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:20,445 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:20,445 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:20,445 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:20,445 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:20,446 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:20,446 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:20,446 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:20,446 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:24:20,446 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:20,446 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:20,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:20,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:20,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:20,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:20,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:20,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:20,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:20,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:20,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:21,003 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2018-11-28 23:24:21,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:21,429 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:21,434 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:21,436 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-28 23:24:21,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:21,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:21,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:21,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:21,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:21,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:21,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:21,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:21,445 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-28 23:24:21,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:21,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:21,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:21,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:21,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:21,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:21,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:21,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:21,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:21,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:21,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:21,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:21,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:21,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:21,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:21,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:21,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:21,451 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-28 23:24:21,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:21,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:21,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:21,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:21,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:21,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:21,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:21,461 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-28 23:24:21,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:21,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:21,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:21,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:21,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:21,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:21,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:21,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:21,466 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-28 23:24:21,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:21,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:21,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:21,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:21,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:21,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:21,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:21,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-28 23:24:21,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:21,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:21,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:21,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:21,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:21,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:21,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:21,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:21,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-28 23:24:21,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:21,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:21,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:21,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:21,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:21,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:21,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:21,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:21,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-28 23:24:21,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:21,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:21,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:21,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:21,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:21,520 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:21,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:21,556 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-28 23:24:21,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:21,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:21,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:21,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:21,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:21,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:21,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:21,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:21,564 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-28 23:24:21,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:21,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:21,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:21,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:21,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:21,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:21,598 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:21,622 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:24:21,622 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:24:21,624 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:21,626 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:21,627 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:21,627 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2018-11-28 23:24:21,681 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:24:21,705 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:24:21,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:21,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:21,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:21,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:21,966 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:21,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 23:24:21,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:21,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-28 23:24:21,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 23:24:22,000 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:22,017 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:22,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:22,029 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:36, output treesize:15 [2018-11-28 23:24:22,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-28 23:24:22,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-28 23:24:22,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:22,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:22,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:22,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2018-11-28 23:24:22,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 23:24:22,345 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-28 23:24:22,346 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-28 23:24:22,612 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 62 states and 73 transitions. Complement of second has 17 states. [2018-11-28 23:24:22,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:22,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:24:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-11-28 23:24:22,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 16 letters. [2018-11-28 23:24:22,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:22,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 16 letters. [2018-11-28 23:24:22,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:22,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 32 letters. [2018-11-28 23:24:22,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:22,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. [2018-11-28 23:24:22,625 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-28 23:24:22,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 67 transitions. [2018-11-28 23:24:22,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-28 23:24:22,629 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-28 23:24:22,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2018-11-28 23:24:22,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:22,629 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-11-28 23:24:22,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2018-11-28 23:24:22,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2018-11-28 23:24:22,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-28 23:24:22,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2018-11-28 23:24:22,641 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-11-28 23:24:22,642 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-11-28 23:24:22,642 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:24:22,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2018-11-28 23:24:22,645 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-28 23:24:22,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:22,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:22,646 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:22,646 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:24:22,647 INFO L794 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 265#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 266#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 254#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 274#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 255#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 256#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 288#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 240#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2018-11-28 23:24:22,647 INFO L796 eck$LassoCheckResult]: Loop: 238#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 241#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 239#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2018-11-28 23:24:22,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:22,647 INFO L82 PathProgramCache]: Analyzing trace with hash -498407605, now seen corresponding path program 1 times [2018-11-28 23:24:22,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:22,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:22,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:22,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:22,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:22,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:22,679 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2018-11-28 23:24:22,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:22,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:22,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:22,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:22,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:22,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:22,694 INFO L82 PathProgramCache]: Analyzing trace with hash -359018118, now seen corresponding path program 2 times [2018-11-28 23:24:22,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:22,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:22,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:22,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:22,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:22,920 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2018-11-28 23:24:23,295 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-11-28 23:24:23,698 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-11-28 23:24:23,821 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-11-28 23:24:24,210 WARN L180 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 101 [2018-11-28 23:24:24,291 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:24,291 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:24,291 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:24,292 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:24,292 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:24,292 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:24,292 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:24,292 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:24,292 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:24:24,293 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:24,293 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:24,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-28 23:24:24,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-28 23:24:24,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-28 23:24:24,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,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-28 23:24:24,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,512 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-11-28 23:24:24,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:24,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-28 23:24:24,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:25,059 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:25,059 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:25,059 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-28 23:24:25,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:25,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:25,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:25,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:25,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:25,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:25,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:25,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:25,066 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-28 23:24:25,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:25,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:25,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:25,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:25,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:25,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:25,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:25,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:25,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:25,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:25,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:25,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:25,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:25,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:25,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:25,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:25,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:25,070 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-28 23:24:25,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:25,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:25,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:25,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:25,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:25,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:25,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:25,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:25,073 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-28 23:24:25,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:25,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:25,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:25,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:25,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:25,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:25,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:25,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:25,075 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-28 23:24:25,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:25,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:25,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:25,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:25,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:25,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:25,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:25,093 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-28 23:24:25,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:25,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:25,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:25,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:25,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:25,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:25,106 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:25,110 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:24:25,111 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:24:25,111 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:25,112 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:25,112 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:25,112 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2018-11-28 23:24:25,129 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 23:24:25,144 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:24:25,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:25,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:25,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:25,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-28 23:24:25,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-28 23:24:25,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:25,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:25,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-28 23:24:25,348 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 23:24:25,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:24:25,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 23:24:25,591 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-28 23:24:25,680 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-28 23:24:25,680 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:24:25,680 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-28 23:24:25,884 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 99 states and 122 transitions. Complement of second has 17 states. [2018-11-28 23:24:25,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:24:25,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-28 23:24:25,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-28 23:24:25,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:25,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-28 23:24:25,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:25,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-28 23:24:25,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:25,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2018-11-28 23:24:25,894 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-28 23:24:25,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 110 transitions. [2018-11-28 23:24:25,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-28 23:24:25,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-28 23:24:25,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2018-11-28 23:24:25,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:25,899 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2018-11-28 23:24:25,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2018-11-28 23:24:25,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-11-28 23:24:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-28 23:24:25,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2018-11-28 23:24:25,912 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-11-28 23:24:25,912 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-11-28 23:24:25,912 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:24:25,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 102 transitions. [2018-11-28 23:24:25,915 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-28 23:24:25,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:25,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:25,916 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:25,916 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:25,917 INFO L794 eck$LassoCheckResult]: Stem: 501#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 500#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 477#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 479#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 544#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 519#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 542#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 541#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 488#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 540#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 548#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 547#recFINAL assume true; 530#recEXIT >#42#return; 527#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 525#recFINAL assume true; 518#recEXIT >#44#return; 473#L38-1 assume !(-1 == main_#t~ret12);main_#t~ite13 := 1; 474#L38-3 [2018-11-28 23:24:25,917 INFO L796 eck$LassoCheckResult]: Loop: 474#L38-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ret12;havoc main_#t~ite13; 509#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 526#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 524#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 505#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 517#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 523#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 506#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 517#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 523#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 504#recFINAL assume true; 507#recEXIT >#42#return; 516#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 522#recFINAL assume true; 515#recEXIT >#44#return; 513#L38-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 474#L38-3 [2018-11-28 23:24:25,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:25,917 INFO L82 PathProgramCache]: Analyzing trace with hash -713572475, now seen corresponding path program 1 times [2018-11-28 23:24:25,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:25,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:25,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:25,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:25,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:26,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:26,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:24:26,514 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-28 23:24:26,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:26,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:26,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-28 23:24:26,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-28 23:24:26,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:26,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:26,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2018-11-28 23:24:26,693 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 23:24:26,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:24:26,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 23:24:26,732 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:25, output treesize:31 [2018-11-28 23:24:26,870 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 23:24:26,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:26,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-28 23:24:26,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 23:24:26,894 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:26,916 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:26,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:26,918 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:51, output treesize:5 [2018-11-28 23:24:26,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:26,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:24:26,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-11-28 23:24:26,972 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:24:26,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:26,972 INFO L82 PathProgramCache]: Analyzing trace with hash 542882406, now seen corresponding path program 2 times [2018-11-28 23:24:26,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:26,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:26,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:26,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:26,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:27,433 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-11-28 23:24:27,698 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-28 23:24:28,169 WARN L180 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 121 [2018-11-28 23:24:28,273 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-11-28 23:24:28,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:24:28,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:24:28,275 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. cyclomatic complexity: 26 Second operand 13 states. [2018-11-28 23:24:28,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:28,462 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2018-11-28 23:24:28,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:24:28,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 110 transitions. [2018-11-28 23:24:28,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:24:28,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 54 states and 67 transitions. [2018-11-28 23:24:28,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 23:24:28,468 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 23:24:28,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 67 transitions. [2018-11-28 23:24:28,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:28,469 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. [2018-11-28 23:24:28,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 67 transitions. [2018-11-28 23:24:28,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-11-28 23:24:28,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 23:24:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-11-28 23:24:28,475 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-28 23:24:28,475 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-28 23:24:28,476 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:24:28,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2018-11-28 23:24:28,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:24:28,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:28,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:28,479 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:28,479 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:24:28,480 INFO L794 eck$LassoCheckResult]: Stem: 728#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 727#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 711#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 712#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 731#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 732#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 743#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 740#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 721#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 738#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 725#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 726#recFINAL assume true; 729#recEXIT >#42#return; 730#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 735#recFINAL assume true; 734#recEXIT >#44#return; 702#L38-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 703#L38-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ret12;havoc main_#t~ite13; 713#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 715#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 718#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 705#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 704#recENTRY [2018-11-28 23:24:28,480 INFO L796 eck$LassoCheckResult]: Loop: 704#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 706#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 707#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 704#recENTRY [2018-11-28 23:24:28,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:28,480 INFO L82 PathProgramCache]: Analyzing trace with hash -873815595, now seen corresponding path program 2 times [2018-11-28 23:24:28,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:28,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:28,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:28,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:28,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:28,558 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 2 times [2018-11-28 23:24:28,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:28,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:28,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:28,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:28,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:28,581 INFO L82 PathProgramCache]: Analyzing trace with hash -43609424, now seen corresponding path program 3 times [2018-11-28 23:24:28,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:28,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:28,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:28,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:28,931 WARN L180 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-11-28 23:24:29,453 WARN L180 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2018-11-28 23:24:30,840 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 224 DAG size of output: 186 [2018-11-28 23:24:31,078 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-28 23:24:31,397 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-11-28 23:24:31,545 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-11-28 23:24:31,548 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:31,548 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:31,549 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:31,549 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:31,549 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:31,549 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:31,549 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:31,549 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:31,549 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D_true-termination.c.i_Iteration5_Lasso [2018-11-28 23:24:31,549 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:31,549 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:31,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,727 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2018-11-28 23:24:31,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:32,463 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:32,463 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:32,464 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-28 23:24:32,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:32,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:32,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:32,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,467 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-28 23:24:32,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:32,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:32,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:32,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,469 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-28 23:24:32,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:32,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:32,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:32,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,471 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-28 23:24:32,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:32,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:32,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:32,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,473 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-28 23:24:32,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:32,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:32,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:32,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,475 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-28 23:24:32,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:32,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:32,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,478 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-28 23:24:32,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:32,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:32,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:32,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,480 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-28 23:24:32,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:32,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:32,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:32,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,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-28 23:24:32,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:32,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:32,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:32,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,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-28 23:24:32,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:32,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:32,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,487 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-28 23:24:32,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:32,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:32,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:32,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,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-28 23:24:32,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:32,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:32,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:32,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,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-28 23:24:32,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:32,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:32,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:32,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,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-28 23:24:32,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:32,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:32,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,496 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-28 23:24:32,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:32,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:32,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,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-28 23:24:32,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:32,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:32,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,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-28 23:24:32,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:32,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:32,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,519 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-28 23:24:32,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,520 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:32,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,521 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:24:32,521 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:32,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:32,523 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-28 23:24:32,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:32,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:32,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:32,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:32,526 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:32,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:32,542 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:32,548 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:24:32,548 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:24:32,549 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:32,550 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:32,550 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:32,550 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) 0)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) 0)_1 + 1 Supporting invariants [] [2018-11-28 23:24:32,608 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2018-11-28 23:24:32,634 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:24:33,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:33,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:33,486 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-11-28 23:24:33,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:33,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:34,137 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:34,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-11-28 23:24:34,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-11-28 23:24:34,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:34,211 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:34,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-11-28 23:24:34,213 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:34,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:24:34,250 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 2 xjuncts. [2018-11-28 23:24:34,251 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:39, output treesize:60 [2018-11-28 23:24:34,285 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-28 23:24:34,285 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-28 23:24:34,286 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 6 states. [2018-11-28 23:24:34,399 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 55 states and 65 transitions. Complement of second has 15 states. [2018-11-28 23:24:34,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:24:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2018-11-28 23:24:34,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-28 23:24:34,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:34,404 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:24:34,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:34,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:34,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:34,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:34,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-11-28 23:24:34,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 40 treesize of output 32 [2018-11-28 23:24:34,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:34,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-11-28 23:24:34,775 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:34,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:24:34,816 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 2 xjuncts. [2018-11-28 23:24:34,816 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:39, output treesize:60 [2018-11-28 23:24:34,844 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-28 23:24:34,845 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-28 23:24:34,845 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 6 states. [2018-11-28 23:24:35,000 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 55 states and 65 transitions. Complement of second has 15 states. [2018-11-28 23:24:35,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:35,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:24:35,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2018-11-28 23:24:35,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-28 23:24:35,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:35,002 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:24:35,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:35,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:35,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:35,215 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:35,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-11-28 23:24:35,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-11-28 23:24:35,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:35,284 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:35,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-11-28 23:24:35,287 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:35,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:24:35,321 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 2 xjuncts. [2018-11-28 23:24:35,321 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:39, output treesize:60 [2018-11-28 23:24:35,352 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-28 23:24:35,353 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-28 23:24:35,353 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 6 states. [2018-11-28 23:24:35,535 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 68 states and 78 transitions. Complement of second has 16 states. [2018-11-28 23:24:35,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:35,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:24:35,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-11-28 23:24:35,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-28 23:24:35,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:35,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 25 letters. Loop has 3 letters. [2018-11-28 23:24:35,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:35,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-28 23:24:35,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:35,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2018-11-28 23:24:35,543 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:24:35,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2018-11-28 23:24:35,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:24:35,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:24:35,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:24:35,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:35,544 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:35,544 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:35,544 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:35,544 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:24:35,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:24:35,544 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:24:35,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:24:35,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:24:35 BoogieIcfgContainer [2018-11-28 23:24:35,552 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:24:35,553 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:24:35,553 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:24:35,553 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:24:35,554 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:16" (3/4) ... [2018-11-28 23:24:35,557 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:24:35,557 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:24:35,558 INFO L168 Benchmark]: Toolchain (without parser) took 19955.37 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 362.8 MB). Free memory was 951.3 MB in the beginning and 1.3 GB in the end (delta: -346.3 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:35,559 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:35,560 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.36 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:35,561 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.07 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:35,561 INFO L168 Benchmark]: Boogie Preprocessor took 42.11 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:35,562 INFO L168 Benchmark]: RCFGBuilder took 582.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:35,563 INFO L168 Benchmark]: BuchiAutomizer took 18906.57 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 224.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -185.3 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:35,563 INFO L168 Benchmark]: Witness Printer took 4.90 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:35,568 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 360.36 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.07 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.11 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 582.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18906.57 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 224.9 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -185.3 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.90 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 8 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][0] + 1 and consists of 7 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 13.4s. Construction of modules took 0.7s. Büchi inclusion checks took 4.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 84 SDtfs, 61 SDslu, 152 SDs, 0 SdLazy, 260 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital370 mio100 ax100 hnf100 lsp98 ukn36 mio100 lsp31 div100 bol100 ite100 ukn100 eq187 hnf88 smp98 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...