./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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_ex11B_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 18b42b65120149c30866fbc5b5479df029781f63 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:05:46,569 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:05:46,571 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:05:46,589 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:05:46,590 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:05:46,592 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:05:46,595 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:05:46,598 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:05:46,600 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:05:46,603 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:05:46,605 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:05:46,606 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:05:46,607 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:05:46,610 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:05:46,611 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:05:46,618 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:05:46,621 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:05:46,625 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:05:46,628 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:05:46,632 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:05:46,634 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:05:46,637 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:05:46,640 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:05:46,640 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:05:46,641 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:05:46,642 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:05:46,642 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:05:46,643 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:05:46,644 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:05:46,645 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:05:46,645 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:05:46,646 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:05:46,646 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:05:46,646 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:05:46,647 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:05:46,648 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:05:46,648 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 22:05:46,673 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:05:46,673 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:05:46,674 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:05:46,675 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:05:46,675 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:05:46,675 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:05:46,676 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:05:46,676 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:05:46,676 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:05:46,676 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:05:46,676 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:05:46,676 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:05:46,677 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:05:46,677 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:05:46,677 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:05:46,677 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:05:46,677 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:05:46,677 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:05:46,678 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:05:46,679 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:05:46,679 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:05:46,680 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:05:46,680 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:05:46,680 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:05:46,680 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:05:46,681 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:05:46,681 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:05:46,681 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:05:46,682 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:05:46,682 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 -> 18b42b65120149c30866fbc5b5479df029781f63 [2019-01-01 22:05:46,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:05:46,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:05:46,751 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:05:46,755 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:05:46,756 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:05:46,757 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i [2019-01-01 22:05:46,828 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9de2f3b8f/00d5b026ee964ef99dd76b7c1926d307/FLAG331d2ab57 [2019-01-01 22:05:47,268 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:05:47,269 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i [2019-01-01 22:05:47,276 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9de2f3b8f/00d5b026ee964ef99dd76b7c1926d307/FLAG331d2ab57 [2019-01-01 22:05:47,626 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9de2f3b8f/00d5b026ee964ef99dd76b7c1926d307 [2019-01-01 22:05:47,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:05:47,631 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:05:47,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:05:47,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:05:47,636 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:05:47,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:05:47" (1/1) ... [2019-01-01 22:05:47,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5255592d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:47, skipping insertion in model container [2019-01-01 22:05:47,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:05:47" (1/1) ... [2019-01-01 22:05:47,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:05:47,668 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:05:47,900 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:05:47,918 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:05:47,936 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:05:47,951 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:05:47,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:47 WrapperNode [2019-01-01 22:05:47,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:05:47,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:05:47,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:05:47,953 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:05:47,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:47" (1/1) ... [2019-01-01 22:05:47,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:47" (1/1) ... [2019-01-01 22:05:47,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:05:47,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:05:47,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:05:47,991 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:05:47,999 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:47" (1/1) ... [2019-01-01 22:05:47,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:47" (1/1) ... [2019-01-01 22:05:48,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:47" (1/1) ... [2019-01-01 22:05:48,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:47" (1/1) ... [2019-01-01 22:05:48,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:47" (1/1) ... [2019-01-01 22:05:48,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:47" (1/1) ... [2019-01-01 22:05:48,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:47" (1/1) ... [2019-01-01 22:05:48,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:05:48,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:05:48,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:05:48,016 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:05:48,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:47" (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 [2019-01-01 22:05:48,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:05:48,155 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-01-01 22:05:48,156 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-01-01 22:05:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 22:05:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:05:48,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:05:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:05:48,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:05:48,537 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:05:48,537 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 22:05:48,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:05:48 BoogieIcfgContainer [2019-01-01 22:05:48,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:05:48,539 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:05:48,539 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:05:48,543 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:05:48,544 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:05:48,544 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:05:47" (1/3) ... [2019-01-01 22:05:48,545 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@509f1983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:05:48, skipping insertion in model container [2019-01-01 22:05:48,545 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:05:48,546 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:47" (2/3) ... [2019-01-01 22:05:48,546 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@509f1983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:05:48, skipping insertion in model container [2019-01-01 22:05:48,546 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:05:48,546 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:05:48" (3/3) ... [2019-01-01 22:05:48,548 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11B_true-termination.c.i [2019-01-01 22:05:48,612 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:05:48,613 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:05:48,613 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:05:48,613 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:05:48,614 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:05:48,614 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:05:48,614 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:05:48,614 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:05:48,614 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:05:48,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-01 22:05:48,661 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 22:05:48,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:48,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:48,669 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:05:48,670 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:48,670 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:05:48,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-01-01 22:05:48,672 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 22:05:48,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:48,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:48,673 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:05:48,673 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:48,682 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#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~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(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; 19#L28-3true [2019-01-01 22:05:48,683 INFO L796 eck$LassoCheckResult]: Loop: 19#L28-3true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 4#L28-1true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(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~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 12#L33true call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 3#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 7#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;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 15#recFINALtrue assume true; 13#recEXITtrue >#39#return; 10#L33-1true assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 5#L33-3true call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ite12;havoc main_#t~ret11; 19#L28-3true [2019-01-01 22:05:48,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:48,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-01-01 22:05:48,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:48,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:48,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:48,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:48,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:48,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:48,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1673639481, now seen corresponding path program 1 times [2019-01-01 22:05:48,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:48,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:48,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:48,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:48,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:48,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:48,951 INFO L82 PathProgramCache]: Analyzing trace with hash -508919995, now seen corresponding path program 1 times [2019-01-01 22:05:48,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:48,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:48,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:48,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:48,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:49,200 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 22:05:49,566 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-01 22:05:50,533 WARN L181 SmtUtils]: Spent 902.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 92 [2019-01-01 22:05:50,747 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:05:50,748 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:05:50,749 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:05:50,749 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:05:50,749 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:05:50,749 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:05:50,749 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:05:50,750 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:05:50,750 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B_true-termination.c.i_Iteration1_Lasso [2019-01-01 22:05:50,750 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:05:50,750 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:05:50,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:50,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:50,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:50,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:50,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:51,003 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-01-01 22:05:51,270 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-01-01 22:05:51,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:51,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:51,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:51,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:51,788 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:05:51,794 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:05:51,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:51,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:51,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:51,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:51,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:51,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:51,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:51,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:51,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:51,806 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 [2019-01-01 22:05:51,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:51,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:51,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:51,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:51,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:51,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:51,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:51,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:51,811 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 [2019-01-01 22:05:51,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:51,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:51,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:51,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:51,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:51,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:51,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:51,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:51,814 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 [2019-01-01 22:05:51,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:51,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:51,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:51,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:51,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:51,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:51,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:51,823 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 [2019-01-01 22:05:51,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:51,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:51,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:51,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:51,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:51,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:51,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:51,852 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 [2019-01-01 22:05:51,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:51,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:51,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:51,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:51,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:51,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:51,874 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:05:51,888 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:05:51,889 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 22:05:51,891 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:05:51,893 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:05:51,894 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:05:51,894 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 [] [2019-01-01 22:05:51,985 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 22:05:52,006 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 22:05:52,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:52,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:52,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:52,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:05:52,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:05:52,397 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 [2019-01-01 22:05:52,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 22:05:52,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-01 22:05:52,423 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 [2019-01-01 22:05:52,424 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 22:05:52,430 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:05:52,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:05:52,440 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:7 [2019-01-01 22:05:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:52,558 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-01 22:05:52,560 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 6 states. [2019-01-01 22:05:52,760 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 6 states. Result 65 states and 78 transitions. Complement of second has 18 states. [2019-01-01 22:05:52,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-01-01 22:05:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 22:05:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2019-01-01 22:05:52,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 2 letters. Loop has 9 letters. [2019-01-01 22:05:52,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:52,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 11 letters. Loop has 9 letters. [2019-01-01 22:05:52,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:52,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 2 letters. Loop has 18 letters. [2019-01-01 22:05:52,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:52,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 78 transitions. [2019-01-01 22:05:52,778 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-01-01 22:05:52,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 47 states and 58 transitions. [2019-01-01 22:05:52,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-01 22:05:52,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-01-01 22:05:52,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 58 transitions. [2019-01-01 22:05:52,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:05:52,790 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 58 transitions. [2019-01-01 22:05:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 58 transitions. [2019-01-01 22:05:52,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-01-01 22:05:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-01 22:05:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2019-01-01 22:05:52,830 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2019-01-01 22:05:52,831 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2019-01-01 22:05:52,831 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:05:52,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 57 transitions. [2019-01-01 22:05:52,833 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2019-01-01 22:05:52,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:52,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:52,834 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:52,834 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:05:52,835 INFO L794 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 192#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~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(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; 193#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 208#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(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~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 188#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 200#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 187#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(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;call ULTIMATE.dealloc(~op.base, ~op.offset); 175#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 173#recENTRY [2019-01-01 22:05:52,835 INFO L796 eck$LassoCheckResult]: Loop: 173#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 176#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(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;call ULTIMATE.dealloc(~op.base, ~op.offset); 174#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 173#recENTRY [2019-01-01 22:05:52,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:52,836 INFO L82 PathProgramCache]: Analyzing trace with hash -15731550, now seen corresponding path program 1 times [2019-01-01 22:05:52,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:52,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:52,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:52,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:52,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:52,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:52,925 INFO L82 PathProgramCache]: Analyzing trace with hash 29951, now seen corresponding path program 1 times [2019-01-01 22:05:52,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:52,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:52,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:52,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:52,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:52,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:52,970 INFO L82 PathProgramCache]: Analyzing trace with hash -507170626, now seen corresponding path program 2 times [2019-01-01 22:05:52,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:52,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:52,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:52,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:52,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:53,355 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-01-01 22:05:53,469 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-01 22:05:53,826 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-01-01 22:05:54,344 WARN L181 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2019-01-01 22:05:54,481 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-01-01 22:05:55,045 WARN L181 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 107 [2019-01-01 22:05:55,208 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-01-01 22:05:55,211 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:05:55,212 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:05:55,212 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:05:55,212 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:05:55,212 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:05:55,212 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:05:55,212 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:05:55,212 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:05:55,212 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B_true-termination.c.i_Iteration2_Lasso [2019-01-01 22:05:55,212 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:05:55,213 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:05:55,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,626 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-01-01 22:05:55,764 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-01-01 22:05:55,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:55,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:05:56,028 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 22:05:56,427 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-01-01 22:05:56,521 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:05:56,521 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:05:56,522 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 [2019-01-01 22:05:56,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:56,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:56,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:56,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:56,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:56,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:56,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:56,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:56,528 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 [2019-01-01 22:05:56,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:56,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:56,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:56,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:56,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:56,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:56,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:56,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:56,531 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 [2019-01-01 22:05:56,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:56,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:56,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:56,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:56,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:56,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:56,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:56,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:56,534 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 [2019-01-01 22:05:56,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:56,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:56,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:56,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:56,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:56,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:56,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:56,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:56,537 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 [2019-01-01 22:05:56,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:56,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:56,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:56,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:56,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:56,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:56,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:56,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:56,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:05:56,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:56,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:05:56,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:56,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:56,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:56,541 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:05:56,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:05:56,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:56,542 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 [2019-01-01 22:05:56,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:56,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:56,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:56,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:56,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:56,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:56,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:56,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 [2019-01-01 22:05:56,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:56,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:56,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:56,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:56,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:56,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:56,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:56,561 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 [2019-01-01 22:05:56,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:56,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:56,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:56,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:56,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:56,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:56,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:56,567 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 [2019-01-01 22:05:56,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:56,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:56,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:56,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:56,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:56,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:56,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:56,575 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 [2019-01-01 22:05:56,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:56,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:56,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:56,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:56,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:56,580 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:56,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:56,597 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 [2019-01-01 22:05:56,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:56,598 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-01 22:05:56,598 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:05:56,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:56,617 INFO L402 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2019-01-01 22:05:56,617 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 22:05:56,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:05:56,701 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 [2019-01-01 22:05:56,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:05:56,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:05:56,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:05:56,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:05:56,710 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:05:56,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:05:56,742 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:05:56,757 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:05:56,757 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:05:56,758 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:05:56,759 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:05:56,761 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:05:56,761 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 [] [2019-01-01 22:05:56,822 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2019-01-01 22:05:56,849 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 22:05:56,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:56,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:56,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:05:57,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:05:57,225 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 [2019-01-01 22:05:57,231 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 [2019-01-01 22:05:57,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:05:57,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:05:57,275 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 [2019-01-01 22:05:57,277 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 22:05:57,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 22:05:57,596 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. [2019-01-01 22:05:57,596 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:39, output treesize:60 [2019-01-01 22:05:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:57,653 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 22:05:57,653 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 57 transitions. cyclomatic complexity: 16 Second operand 5 states. [2019-01-01 22:05:57,880 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 57 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 128 states and 165 transitions. Complement of second has 18 states. [2019-01-01 22:05:57,885 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 [2019-01-01 22:05:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:05:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2019-01-01 22:05:57,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 8 letters. Loop has 3 letters. [2019-01-01 22:05:57,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:57,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 11 letters. Loop has 3 letters. [2019-01-01 22:05:57,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:57,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-01 22:05:57,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:05:57,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 165 transitions. [2019-01-01 22:05:57,897 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-01-01 22:05:57,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 110 states and 147 transitions. [2019-01-01 22:05:57,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2019-01-01 22:05:57,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2019-01-01 22:05:57,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 147 transitions. [2019-01-01 22:05:57,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:05:57,905 INFO L705 BuchiCegarLoop]: Abstraction has 110 states and 147 transitions. [2019-01-01 22:05:57,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 147 transitions. [2019-01-01 22:05:57,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2019-01-01 22:05:57,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 22:05:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2019-01-01 22:05:57,921 INFO L728 BuchiCegarLoop]: Abstraction has 104 states and 135 transitions. [2019-01-01 22:05:57,921 INFO L608 BuchiCegarLoop]: Abstraction has 104 states and 135 transitions. [2019-01-01 22:05:57,921 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:05:57,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 135 transitions. [2019-01-01 22:05:57,924 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2019-01-01 22:05:57,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:57,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:57,925 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:57,925 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:57,925 INFO L794 eck$LassoCheckResult]: Stem: 455#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 449#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~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(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; 450#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 474#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(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~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 502#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 504#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 508#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;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 506#recFINAL assume true; 503#recEXIT >#39#return; 500#L33-1 assume !(main_#t~ret11 <= -1);main_#t~ite12 := 1; 445#L33-3 [2019-01-01 22:05:57,925 INFO L796 eck$LassoCheckResult]: Loop: 445#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ite12;havoc main_#t~ret11; 446#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 487#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(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~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 480#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 496#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 497#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;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 488#recFINAL assume true; 489#recEXIT >#39#return; 499#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 445#L33-3 [2019-01-01 22:05:57,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:57,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2061793209, now seen corresponding path program 1 times [2019-01-01 22:05:57,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:57,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:57,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:57,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:57,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:58,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:05:58,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:05:58,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:05:58,015 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:05:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:58,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1530037457, now seen corresponding path program 2 times [2019-01-01 22:05:58,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:58,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:58,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:58,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:58,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:58,308 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 22:05:58,535 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 22:05:58,821 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-01 22:05:59,153 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2019-01-01 22:05:59,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 22:05:59,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 22:05:59,231 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. cyclomatic complexity: 41 Second operand 5 states. [2019-01-01 22:05:59,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:05:59,276 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2019-01-01 22:05:59,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 22:05:59,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 123 transitions. [2019-01-01 22:05:59,281 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-01-01 22:05:59,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 92 states and 117 transitions. [2019-01-01 22:05:59,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2019-01-01 22:05:59,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-01-01 22:05:59,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 117 transitions. [2019-01-01 22:05:59,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:05:59,285 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 117 transitions. [2019-01-01 22:05:59,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 117 transitions. [2019-01-01 22:05:59,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2019-01-01 22:05:59,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-01 22:05:59,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2019-01-01 22:05:59,295 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 115 transitions. [2019-01-01 22:05:59,295 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 115 transitions. [2019-01-01 22:05:59,295 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:05:59,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 115 transitions. [2019-01-01 22:05:59,298 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-01-01 22:05:59,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:59,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:59,301 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:59,301 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:59,301 INFO L794 eck$LassoCheckResult]: Stem: 670#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 660#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~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(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; 661#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 684#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(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~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 704#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 708#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.allocOnHeap(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;call ULTIMATE.dealloc(~op.base, ~op.offset); 666#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 701#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 702#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;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 718#recFINAL assume true; 710#recEXIT >#37#return; 707#L19-1 #res := #t~ret5;havoc #t~ret5; 705#recFINAL assume true; 703#recEXIT >#39#return; 668#L33-1 assume !(main_#t~ret11 <= -1);main_#t~ite12 := 1; 656#L33-3 [2019-01-01 22:05:59,301 INFO L796 eck$LassoCheckResult]: Loop: 656#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ite12;havoc main_#t~ret11; 657#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 696#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(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~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 692#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 695#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 699#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;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 698#recFINAL assume true; 697#recEXIT >#39#return; 686#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 656#L33-3 [2019-01-01 22:05:59,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:59,301 INFO L82 PathProgramCache]: Analyzing trace with hash 970657719, now seen corresponding path program 1 times [2019-01-01 22:05:59,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:59,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:59,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:59,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:59,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 22:05:59,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:05:59,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 22:05:59,400 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:05:59,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:59,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1530037457, now seen corresponding path program 3 times [2019-01-01 22:05:59,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:59,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:59,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:59,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:59,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:59,734 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 22:05:59,974 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 22:06:00,329 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-01 22:06:00,744 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 91 [2019-01-01 22:06:00,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 22:06:00,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 22:06:00,802 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. cyclomatic complexity: 33 Second operand 6 states. [2019-01-01 22:06:00,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:06:00,843 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2019-01-01 22:06:00,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 22:06:00,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 96 transitions. [2019-01-01 22:06:00,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:06:00,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 52 states and 63 transitions. [2019-01-01 22:06:00,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 22:06:00,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-01 22:06:00,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 63 transitions. [2019-01-01 22:06:00,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:06:00,850 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2019-01-01 22:06:00,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 63 transitions. [2019-01-01 22:06:00,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-01-01 22:06:00,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-01 22:06:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2019-01-01 22:06:00,857 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2019-01-01 22:06:00,857 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2019-01-01 22:06:00,857 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:06:00,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 60 transitions. [2019-01-01 22:06:00,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:06:00,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:00,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:00,859 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:00,859 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:06:00,859 INFO L794 eck$LassoCheckResult]: Stem: 839#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 833#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~mem13, main_#t~ret11, main_#t~ite12, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(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; 834#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 828#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(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~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 829#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 853#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 860#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(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;call ULTIMATE.dealloc(~op.base, ~op.offset); 842#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 862#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 866#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;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 864#recFINAL assume true; 845#recEXIT >#37#return; 846#L19-1 #res := #t~ret5;havoc #t~ret5; 858#recFINAL assume true; 854#recEXIT >#39#return; 838#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 830#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ite12;havoc main_#t~ret11; 831#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 827#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(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~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 820#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 819#recENTRY [2019-01-01 22:06:00,859 INFO L796 eck$LassoCheckResult]: Loop: 819#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 821#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(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;call ULTIMATE.dealloc(~op.base, ~op.offset); 822#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 819#recENTRY [2019-01-01 22:06:00,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:00,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1312873862, now seen corresponding path program 1 times [2019-01-01 22:06:00,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:00,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:00,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:00,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:00,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:00,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:00,906 INFO L82 PathProgramCache]: Analyzing trace with hash 29951, now seen corresponding path program 2 times [2019-01-01 22:06:00,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:00,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:00,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:00,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:00,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:00,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:00,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1853025306, now seen corresponding path program 2 times [2019-01-01 22:06:00,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:00,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:00,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:00,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:00,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:01,223 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-01-01 22:06:01,768 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-01-01 22:06:03,804 WARN L181 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 215 DAG size of output: 183 [2019-01-01 22:06:04,097 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-01-01 22:06:04,398 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-01-01 22:06:04,619 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-01 22:06:04,623 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:06:04,623 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:06:04,623 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:06:04,623 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:06:04,624 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:06:04,624 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:06:04,624 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:06:04,624 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:06:04,624 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B_true-termination.c.i_Iteration5_Lasso [2019-01-01 22:06:04,624 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:06:04,625 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:06:04,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,932 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-01-01 22:06:04,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:04,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:05,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:05,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:05,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:05,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:06:05,924 WARN L181 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 22:06:06,012 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:06:06,013 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:06:06,014 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 [2019-01-01 22:06:06,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:06,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:06,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:06,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:06,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:06,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:06,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:06,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:06,022 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 [2019-01-01 22:06:06,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:06,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:06,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:06,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:06,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:06,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:06,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:06,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:06,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:06,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:06,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:06,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:06,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:06,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:06,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:06,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:06,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:06,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:06,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:06,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:06,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:06,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:06,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:06,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:06,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:06,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:06,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:06,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:06,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:06,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:06,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:06,043 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:06,043 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:06,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:06,051 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 [2019-01-01 22:06:06,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:06,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:06,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:06,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:06,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:06,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:06,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:06,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:06,055 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 [2019-01-01 22:06:06,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:06,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:06,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:06,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:06,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:06,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:06,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:06,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:06,061 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 [2019-01-01 22:06:06,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:06,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:06,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:06,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:06,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:06,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:06,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:06,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:06,063 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 [2019-01-01 22:06:06,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:06,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:06,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:06,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:06,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:06,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:06,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:06,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:06,078 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 [2019-01-01 22:06:06,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:06,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:06,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:06,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:06,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:06,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:06,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:06,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:06,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:06,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:06,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:06,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:06,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:06,087 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:06,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:06,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:06,087 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 [2019-01-01 22:06:06,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:06,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:06,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:06,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:06,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:06,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:06,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:06,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:06,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 [2019-01-01 22:06:06,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:06,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:06,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:06,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:06,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:06,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:06,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:06,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:06,097 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 [2019-01-01 22:06:06,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:06,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:06,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:06,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:06,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:06,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:06,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:06,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:06,102 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 [2019-01-01 22:06:06,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:06,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:06,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:06,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:06,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:06,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:06,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:06,107 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 [2019-01-01 22:06:06,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:06,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:06,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:06,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:06,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:06,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:06,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:06,123 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 [2019-01-01 22:06:06,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:06,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:06,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:06,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:06,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:06,128 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:06,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:06,134 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 [2019-01-01 22:06:06,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:06,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:06,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:06,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:06,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:06,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:06,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:06,140 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 [2019-01-01 22:06:06,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:06,140 INFO L205 nArgumentSynthesizer]: 16 stem disjuncts [2019-01-01 22:06:06,141 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:06:06,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:06,159 INFO L402 nArgumentSynthesizer]: We have 76 Motzkin's Theorem applications. [2019-01-01 22:06:06,160 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 22:06:06,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:06,202 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 [2019-01-01 22:06:06,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:06,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:06,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:06,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:06,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:06,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:06,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:06,215 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 [2019-01-01 22:06:06,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:06,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:06,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:06,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:06,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:06,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:06,228 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:06:06,232 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:06:06,232 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:06:06,232 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:06:06,234 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:06:06,234 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:06:06,234 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2019-01-01 22:06:06,269 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 22:06:06,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 22:06:06,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:06,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:06,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:06,619 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 [2019-01-01 22:06:06,626 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 [2019-01-01 22:06:06,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:06,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:06,677 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 [2019-01-01 22:06:06,680 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 22:06:06,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 22:06:06,728 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. [2019-01-01 22:06:06,729 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2019-01-01 22:06:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:06:06,758 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 22:06:06,758 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16 Second operand 5 states. [2019-01-01 22:06:06,889 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 78 states and 96 transitions. Complement of second has 16 states. [2019-01-01 22:06:06,890 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 [2019-01-01 22:06:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:06:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-01-01 22:06:06,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 20 letters. Loop has 3 letters. [2019-01-01 22:06:06,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:06,891 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:06:06,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:06,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:07,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:07,073 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 [2019-01-01 22:06:07,077 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 [2019-01-01 22:06:07,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:07,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:07,137 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 [2019-01-01 22:06:07,139 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 22:06:07,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 22:06:07,183 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. [2019-01-01 22:06:07,183 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2019-01-01 22:06:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:06:07,208 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 22:06:07,208 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16 Second operand 5 states. [2019-01-01 22:06:07,336 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 78 states and 96 transitions. Complement of second has 16 states. [2019-01-01 22:06:07,339 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 [2019-01-01 22:06:07,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:06:07,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-01-01 22:06:07,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 20 letters. Loop has 3 letters. [2019-01-01 22:06:07,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:07,340 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:06:07,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:07,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:07,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:07,510 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 [2019-01-01 22:06:07,515 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 [2019-01-01 22:06:07,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:07,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:07,576 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 [2019-01-01 22:06:07,578 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 22:06:07,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 22:06:07,623 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. [2019-01-01 22:06:07,623 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2019-01-01 22:06:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:06:07,646 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-01 22:06:07,646 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16 Second operand 5 states. [2019-01-01 22:06:07,757 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 76 states and 88 transitions. Complement of second has 17 states. [2019-01-01 22:06:07,759 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 [2019-01-01 22:06:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:06:07,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-01-01 22:06:07,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 20 letters. Loop has 3 letters. [2019-01-01 22:06:07,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:07,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 23 letters. Loop has 3 letters. [2019-01-01 22:06:07,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:07,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 20 letters. Loop has 6 letters. [2019-01-01 22:06:07,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:07,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 88 transitions. [2019-01-01 22:06:07,767 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:06:07,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 0 states and 0 transitions. [2019-01-01 22:06:07,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:06:07,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:06:07,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:06:07,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:06:07,767 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:06:07,769 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:06:07,769 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:06:07,769 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:06:07,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:06:07,770 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:06:07,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:06:07,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:06:07 BoogieIcfgContainer [2019-01-01 22:06:07,779 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:06:07,779 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:06:07,780 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:06:07,780 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:06:07,780 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:05:48" (3/4) ... [2019-01-01 22:06:07,786 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:06:07,786 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:06:07,787 INFO L168 Benchmark]: Toolchain (without parser) took 20157.00 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.0 MB). Free memory was 951.3 MB in the beginning and 838.5 MB in the end (delta: 112.9 MB). Peak memory consumption was 426.9 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:07,789 INFO L168 Benchmark]: CDTParser took 0.16 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. [2019-01-01 22:06:07,790 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.45 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. [2019-01-01 22:06:07,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.06 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. [2019-01-01 22:06:07,792 INFO L168 Benchmark]: Boogie Preprocessor took 24.76 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. [2019-01-01 22:06:07,793 INFO L168 Benchmark]: RCFGBuilder took 522.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -169.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:07,793 INFO L168 Benchmark]: BuchiAutomizer took 19240.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 838.5 MB in the end (delta: 265.9 MB). Peak memory consumption was 450.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:07,797 INFO L168 Benchmark]: Witness Printer took 7.02 ms. Allocated memory is still 1.3 GB. Free memory is still 838.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:06:07,802 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.16 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 319.45 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 38.06 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 24.76 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 522.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -169.1 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 19240.50 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 838.5 MB in the end (delta: 265.9 MB). Peak memory consumption was 450.4 MB. Max. memory is 11.5 GB. * Witness Printer took 7.02 ms. Allocated memory is still 1.3 GB. Free memory is still 838.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 9 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][0] + 1 and consists of 6 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 19.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 15.5s. Construction of modules took 0.3s. Büchi inclusion checks took 3.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 104 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 82 SDtfs, 59 SDslu, 126 SDs, 0 SdLazy, 175 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital361 mio100 ax100 hnf100 lsp97 ukn44 mio100 lsp29 div100 bol100 ite100 ukn100 eq180 hnf92 smp100 dnf416 smp89 tf100 neg87 sie149 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 63ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 16 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 76 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...