./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11_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_ex11_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 2e31c843d33c80f978b3ed5615692b93565f0ae0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:54,296 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:05:54,297 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:05:54,310 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:05:54,310 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:05:54,311 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:05:54,312 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:05:54,317 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:05:54,322 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:05:54,324 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:05:54,326 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:05:54,327 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:05:54,330 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:05:54,332 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:05:54,339 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:05:54,340 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:05:54,341 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:05:54,343 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:05:54,349 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:05:54,353 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:05:54,356 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:05:54,359 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:05:54,362 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:05:54,362 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:05:54,362 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:05:54,366 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:05:54,367 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:05:54,368 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:05:54,371 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:05:54,373 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:05:54,374 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:05:54,374 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:05:54,374 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:05:54,376 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:05:54,377 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:05:54,378 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:05:54,380 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:54,407 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:05:54,407 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:05:54,408 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:05:54,408 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:05:54,408 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:05:54,409 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:05:54,409 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:05:54,409 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:05:54,410 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:05:54,410 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:05:54,410 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:05:54,410 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:05:54,410 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:05:54,411 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:05:54,412 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:05:54,412 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:05:54,412 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:05:54,412 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:05:54,412 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:05:54,412 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:05:54,413 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:05:54,413 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:05:54,413 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:05:54,413 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:05:54,413 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:05:54,413 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:05:54,415 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:05:54,415 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:05:54,416 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:05:54,416 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 -> 2e31c843d33c80f978b3ed5615692b93565f0ae0 [2019-01-01 22:05:54,455 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:05:54,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:05:54,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:05:54,473 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:05:54,474 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:05:54,474 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11_true-termination.c.i [2019-01-01 22:05:54,533 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbde607d4/54fdc37f0510469dbe96a638cf198bba/FLAGe6996ea8f [2019-01-01 22:05:54,980 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:05:54,981 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11_true-termination.c.i [2019-01-01 22:05:54,990 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbde607d4/54fdc37f0510469dbe96a638cf198bba/FLAGe6996ea8f [2019-01-01 22:05:55,326 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbde607d4/54fdc37f0510469dbe96a638cf198bba [2019-01-01 22:05:55,330 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:05:55,331 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:05:55,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:05:55,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:05:55,337 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:05:55,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:05:55" (1/1) ... [2019-01-01 22:05:55,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae90c95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:55, skipping insertion in model container [2019-01-01 22:05:55,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:05:55" (1/1) ... [2019-01-01 22:05:55,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:05:55,378 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:05:55,631 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:05:55,654 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:05:55,677 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:05:55,699 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:05:55,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:55 WrapperNode [2019-01-01 22:05:55,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:05:55,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:05:55,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:05:55,701 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:05:55,710 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:55" (1/1) ... [2019-01-01 22:05:55,726 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:55" (1/1) ... [2019-01-01 22:05:55,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:05:55,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:05:55,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:05:55,748 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:05:55,758 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:55" (1/1) ... [2019-01-01 22:05:55,758 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:55" (1/1) ... [2019-01-01 22:05:55,760 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:55" (1/1) ... [2019-01-01 22:05:55,761 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:55" (1/1) ... [2019-01-01 22:05:55,774 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:55" (1/1) ... [2019-01-01 22:05:55,784 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:55" (1/1) ... [2019-01-01 22:05:55,791 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:55" (1/1) ... [2019-01-01 22:05:55,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:05:55,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:05:55,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:05:55,797 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:05:55,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:55" (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:55,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:05:55,920 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-01-01 22:05:55,920 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-01-01 22:05:55,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 22:05:55,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:05:55,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:05:55,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:05:55,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:05:56,291 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:05:56,291 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 22:05:56,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:05:56 BoogieIcfgContainer [2019-01-01 22:05:56,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:05:56,292 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:05:56,293 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:05:56,296 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:05:56,297 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:05:56,297 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:05:55" (1/3) ... [2019-01-01 22:05:56,298 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d1eb1cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:05:56, skipping insertion in model container [2019-01-01 22:05:56,298 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:05:56,298 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:05:55" (2/3) ... [2019-01-01 22:05:56,299 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d1eb1cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:05:56, skipping insertion in model container [2019-01-01 22:05:56,299 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:05:56,299 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:05:56" (3/3) ... [2019-01-01 22:05:56,301 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11_true-termination.c.i [2019-01-01 22:05:56,381 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:05:56,381 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:05:56,382 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:05:56,382 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:05:56,382 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:05:56,382 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:05:56,382 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:05:56,382 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:05:56,383 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:05:56,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 22:05:56,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 22:05:56,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:56,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:56,439 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:05:56,440 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:56,440 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:05:56,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-01 22:05:56,442 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 22:05:56,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:56,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:56,446 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:05:56,446 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:56,456 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.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:56,457 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~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 9#L32true assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 20#L36true call main_#t~ret12 := 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); 6#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; 14#recFINALtrue assume true; 12#recEXITtrue >#44#return; 18#L36-1true assume -1 == main_#t~ret12;main_#t~ite13 := -1; 11#L36-3true call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ite13;havoc main_#t~ret12; 19#L28-3true [2019-01-01 22:05:56,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:56,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-01-01 22:05:56,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:56,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:56,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:56,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:56,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:56,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:56,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2107477180, now seen corresponding path program 1 times [2019-01-01 22:05:56,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:56,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:56,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:56,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:56,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:05:56,935 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:56,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:05:56,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 22:05:56,943 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:05:56,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 22:05:56,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 22:05:56,960 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2019-01-01 22:05:57,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:05:57,189 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-01-01 22:05:57,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 22:05:57,192 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-01-01 22:05:57,195 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 22:05:57,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 19 transitions. [2019-01-01 22:05:57,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-01 22:05:57,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-01 22:05:57,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2019-01-01 22:05:57,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:05:57,212 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-01-01 22:05:57,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2019-01-01 22:05:57,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-01 22:05:57,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-01 22:05:57,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-01-01 22:05:57,245 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-01-01 22:05:57,245 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-01-01 22:05:57,245 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:05:57,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-01-01 22:05:57,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-01-01 22:05:57,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:05:57,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:05:57,248 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:05:57,248 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:05:57,248 INFO L794 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 57#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.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; 58#L28-3 [2019-01-01 22:05:57,248 INFO L796 eck$LassoCheckResult]: Loop: 58#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 55#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~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 56#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 52#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 51#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 54#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.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); 53#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 51#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 54#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 59#recFINAL assume true; 64#recEXIT >#42#return; 61#L19-1 #res := #t~ret5;havoc #t~ret5; 62#recFINAL assume true; 66#recEXIT >#44#return; 65#L36-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 63#L36-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ite13;havoc main_#t~ret12; 58#L28-3 [2019-01-01 22:05:57,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:57,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2019-01-01 22:05:57,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:57,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:57,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:57,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:57,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:57,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:57,267 INFO L82 PathProgramCache]: Analyzing trace with hash 290320444, now seen corresponding path program 1 times [2019-01-01 22:05:57,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:57,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:57,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:57,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:05:57,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:57,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:05:57,411 INFO L82 PathProgramCache]: Analyzing trace with hash -645910274, now seen corresponding path program 1 times [2019-01-01 22:05:57,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:05:57,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:05:57,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:57,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:05:57,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:05:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:05:57,846 WARN L181 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-01 22:05:58,029 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-01 22:05:58,744 WARN L181 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 92 [2019-01-01 22:05:58,874 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-01-01 22:05:59,094 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-01-01 22:05:59,211 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-01 22:05:59,915 WARN L181 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 123 [2019-01-01 22:06:00,066 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-01 22:06:00,203 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:06:00,204 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:06:00,204 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:06:00,205 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:06:00,205 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:06:00,205 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:06:00,205 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:06:00,205 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:06:00,205 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11_true-termination.c.i_Iteration2_Lasso [2019-01-01 22:06:00,206 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:06:00,206 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:06:00,227 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:00,243 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:00,246 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:00,248 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:00,260 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:00,263 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:00,448 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-01-01 22:06:00,796 WARN L181 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-01-01 22:06:00,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:06:00,835 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:00,854 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:00,859 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:01,279 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2019-01-01 22:06:01,390 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:06:01,395 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:06:01,398 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:01,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:01,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:01,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:01,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:01,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:01,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:01,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:01,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:01,406 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:01,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:01,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:01,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:01,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:01,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:01,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:01,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:01,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:01,409 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:01,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:01,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:01,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:01,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:01,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:01,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:01,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:01,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:01,411 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:01,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:01,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:01,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:01,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:01,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:01,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:01,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:01,419 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:01,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:01,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:01,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:01,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:01,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:01,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:01,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:01,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:01,422 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:01,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:01,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:01,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:01,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:01,427 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:01,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:01,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:01,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:01,445 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:01,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:01,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:01,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:01,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:01,446 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:01,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:01,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:01,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:01,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:01,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:01,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:01,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:01,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:01,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:01,469 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:06:01,480 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:06:01,480 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 22:06:01,484 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:06:01,486 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:06:01,486 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:06:01,487 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:06:01,568 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 22:06:01,591 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 22:06:01,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:01,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:01,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:01,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:01,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:01,747 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:06:01,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:01,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2019-01-01 22:06:01,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-01 22:06:01,807 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:01,818 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:01,829 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:01,830 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:36, output treesize:15 [2019-01-01 22:06:01,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2019-01-01 22:06:01,871 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:06:01,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:01,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:01,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:01,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2019-01-01 22:06:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 22:06:02,016 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-01-01 22:06:02,017 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-01-01 22:06:02,258 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 62 states and 73 transitions. Complement of second has 17 states. [2019-01-01 22:06:02,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-01-01 22:06:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 22:06:02,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2019-01-01 22:06:02,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 16 letters. [2019-01-01 22:06:02,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:02,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 16 letters. [2019-01-01 22:06:02,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:02,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 32 letters. [2019-01-01 22:06:02,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:02,270 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. [2019-01-01 22:06:02,276 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-01-01 22:06:02,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 67 transitions. [2019-01-01 22:06:02,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-01-01 22:06:02,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-01-01 22:06:02,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2019-01-01 22:06:02,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:06:02,280 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-01-01 22:06:02,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2019-01-01 22:06:02,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2019-01-01 22:06:02,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-01 22:06:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2019-01-01 22:06:02,289 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-01-01 22:06:02,289 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-01-01 22:06:02,289 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:06:02,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2019-01-01 22:06:02,295 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-01-01 22:06:02,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:02,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:02,296 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:02,296 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:06:02,296 INFO L794 eck$LassoCheckResult]: Stem: 255#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 249#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.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; 250#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 245#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~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 246#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 256#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 274#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 285#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); 240#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2019-01-01 22:06:02,296 INFO L796 eck$LassoCheckResult]: Loop: 238#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 241#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.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); 239#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2019-01-01 22:06:02,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:02,297 INFO L82 PathProgramCache]: Analyzing trace with hash -498407605, now seen corresponding path program 1 times [2019-01-01 22:06:02,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:02,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:02,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:02,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:02,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:02,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:02,337 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2019-01-01 22:06:02,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:02,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:02,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:02,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:02,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:02,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:02,371 INFO L82 PathProgramCache]: Analyzing trace with hash -359018118, now seen corresponding path program 2 times [2019-01-01 22:06:02,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:02,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:02,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:02,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:02,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:02,604 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-01-01 22:06:02,950 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-01-01 22:06:03,363 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-01-01 22:06:03,634 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-01 22:06:04,001 WARN L181 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 107 [2019-01-01 22:06:04,218 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-01-01 22:06:04,221 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:06:04,221 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:06:04,221 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:06:04,221 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:06:04,221 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:06:04,221 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:06:04,221 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:06:04,222 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:06:04,222 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11_true-termination.c.i_Iteration3_Lasso [2019-01-01 22:06:04,222 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:06:04,222 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:06:04,229 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,233 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,235 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,236 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,243 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,245 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,246 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,248 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,249 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,252 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,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:06:04,282 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,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:06:04,290 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,291 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,457 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-01-01 22:06:04,598 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-01-01 22:06:04,599 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,601 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,606 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,608 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,610 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,619 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,623 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,625 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,628 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,630 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,633 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,636 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,639 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,641 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,643 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,646 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,649 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,656 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,278 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2019-01-01 22:06:05,418 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:06:05,418 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:06:05,419 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:05,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:05,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:05,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:05,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:05,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:05,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:05,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:05,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:05,424 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:05,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:05,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:05,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:05,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:05,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:05,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:05,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:05,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:05,427 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:05,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:05,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:05,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:05,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:05,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:05,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:05,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:05,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:05,429 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:05,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:05,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:05,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:05,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:05,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:05,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:05,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:05,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:05,432 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:05,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:05,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:05,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:05,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:05,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:05,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:05,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:05,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:05,437 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:05,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:05,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:05,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:05,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:05,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:05,438 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:05,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:05,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:05,439 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:05,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:05,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:05,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:05,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:05,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:05,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:05,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:05,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:05,442 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:05,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:05,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:05,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:05,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:05,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:05,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:05,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:05,444 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:05,444 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:05,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:05,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:05,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:05,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:05,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:05,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:05,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:05,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:05,446 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:05,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:05,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:05,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:05,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:05,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:05,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:05,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:05,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:05,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:05,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:05,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:05,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:05,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:05,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:05,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:05,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:05,454 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:05,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:05,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:05,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:05,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:05,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:05,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:05,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:05,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:05,456 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:05,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:05,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:05,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:05,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:05,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:05,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:05,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:05,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:05,458 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:05,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:05,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:05,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:05,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:05,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:05,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:05,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:05,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:05,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:05,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:05,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:05,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:05,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:05,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:05,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:05,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:05,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:05,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:05,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:05,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:05,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:05,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:05,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:05,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:05,479 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:05,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:05,479 INFO L205 nArgumentSynthesizer]: 8 stem disjuncts [2019-01-01 22:06:05,480 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:06:05,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:05,497 INFO L402 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2019-01-01 22:06:05,499 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 22:06:05,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:05,565 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:05,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:05,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:05,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:05,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:05,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:05,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:05,595 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:06:05,610 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 22:06:05,610 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 22:06:05,611 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:06:05,611 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:06:05,612 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:06:05,612 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2019-01-01 22:06:05,669 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-01-01 22:06:05,687 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 22:06:05,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:05,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:06,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:06,304 INFO L303 Elim1Store]: Index analysis took 111 ms [2019-01-01 22:06:06,319 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,326 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,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:06,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:06,375 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,379 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 22:06:06,420 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,441 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,442 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2019-01-01 22:06:06,496 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,496 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 22:06:06,497 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-01-01 22:06:06,658 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 99 states and 122 transitions. Complement of second has 17 states. [2019-01-01 22:06:06,662 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,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:06:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-01-01 22:06:06,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 22:06:06,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:06,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-01 22:06:06,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:06,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-01 22:06:06,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:06,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2019-01-01 22:06:06,671 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-01-01 22:06:06,675 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 110 transitions. [2019-01-01 22:06:06,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-01-01 22:06:06,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2019-01-01 22:06:06,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2019-01-01 22:06:06,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:06:06,678 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2019-01-01 22:06:06,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2019-01-01 22:06:06,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-01-01 22:06:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-01 22:06:06,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2019-01-01 22:06:06,690 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-01-01 22:06:06,690 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-01-01 22:06:06,690 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:06:06,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 102 transitions. [2019-01-01 22:06:06,694 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-01-01 22:06:06,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:06,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:06,696 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:06,697 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:06,697 INFO L794 eck$LassoCheckResult]: Stem: 492#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 484#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.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; 485#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 510#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~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 546#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 521#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 544#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 543#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); 471#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 470#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 473#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; 482#recFINAL assume true; 505#recEXIT >#42#return; 530#L19-1 #res := #t~ret5;havoc #t~ret5; 529#recFINAL assume true; 520#recEXIT >#44#return; 508#L36-1 assume !(-1 == main_#t~ret12);main_#t~ite13 := 1; 499#L36-3 [2019-01-01 22:06:06,697 INFO L796 eck$LassoCheckResult]: Loop: 499#L36-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ite13;havoc main_#t~ret12; 500#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 531#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~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 526#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 512#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 513#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 536#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); 524#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 513#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 536#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; 537#recFINAL assume true; 535#recEXIT >#42#return; 525#L19-1 #res := #t~ret5;havoc #t~ret5; 533#recFINAL assume true; 523#recEXIT >#44#return; 519#L36-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 499#L36-3 [2019-01-01 22:06:06,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:06,697 INFO L82 PathProgramCache]: Analyzing trace with hash -713572475, now seen corresponding path program 1 times [2019-01-01 22:06:06,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:06,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:06,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:06,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:06,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:06,937 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 7 [2019-01-01 22:06:07,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:06:07,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:06:07,142 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:06:07,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:07,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:07,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2019-01-01 22:06:07,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-01 22:06:07,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:07,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:07,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2019-01-01 22:06:07,540 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 22:06:07,559 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,574 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,575 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:25, output treesize:31 [2019-01-01 22:06:07,701 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-01 22:06:07,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:07,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-01 22:06:07,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2019-01-01 22:06:07,714 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:07,716 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:07,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:06:07,719 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:51, output treesize:5 [2019-01-01 22:06:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:06:07,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:06:07,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2019-01-01 22:06:07,761 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:06:07,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:07,761 INFO L82 PathProgramCache]: Analyzing trace with hash 542882406, now seen corresponding path program 2 times [2019-01-01 22:06:07,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:07,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:07,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:07,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:06:07,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:07,989 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 22:06:08,386 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 90 [2019-01-01 22:06:08,659 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-01-01 22:06:09,200 WARN L181 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 129 [2019-01-01 22:06:09,349 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-01-01 22:06:09,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 22:06:09,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-01-01 22:06:09,350 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. cyclomatic complexity: 26 Second operand 13 states. [2019-01-01 22:06:09,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:06:09,543 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-01-01 22:06:09,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 22:06:09,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 110 transitions. [2019-01-01 22:06:09,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:06:09,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 54 states and 67 transitions. [2019-01-01 22:06:09,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-01 22:06:09,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-01 22:06:09,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 67 transitions. [2019-01-01 22:06:09,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:06:09,552 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. [2019-01-01 22:06:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 67 transitions. [2019-01-01 22:06:09,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-01-01 22:06:09,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-01 22:06:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-01-01 22:06:09,561 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-01-01 22:06:09,561 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-01-01 22:06:09,561 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:06:09,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2019-01-01 22:06:09,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:06:09,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:06:09,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:06:09,565 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:06:09,565 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:06:09,565 INFO L794 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 720#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.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; 721#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 735#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~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 725#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 711#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 710#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 712#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); 718#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 741#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 717#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; 719#recFINAL assume true; 740#recEXIT >#42#return; 739#L19-1 #res := #t~ret5;havoc #t~ret5; 738#recFINAL assume true; 736#recEXIT >#44#return; 734#L36-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 730#L36-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem14;havoc main_#t~ite13;havoc main_#t~ret12; 731#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 713#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~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 714#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 709#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 706#recENTRY [2019-01-01 22:06:09,566 INFO L796 eck$LassoCheckResult]: Loop: 706#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 708#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); 707#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 706#recENTRY [2019-01-01 22:06:09,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:09,566 INFO L82 PathProgramCache]: Analyzing trace with hash -873815595, now seen corresponding path program 2 times [2019-01-01 22:06:09,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:09,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:09,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:09,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:09,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:09,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:09,607 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 2 times [2019-01-01 22:06:09,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:09,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:09,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:09,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:09,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:09,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:09,625 INFO L82 PathProgramCache]: Analyzing trace with hash -43609424, now seen corresponding path program 3 times [2019-01-01 22:06:09,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:06:09,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:06:09,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:09,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:06:09,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:06:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:06:09,875 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2019-01-01 22:06:10,418 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2019-01-01 22:06:12,109 WARN L181 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 230 DAG size of output: 191 [2019-01-01 22:06:12,607 WARN L181 SmtUtils]: Spent 491.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2019-01-01 22:06:13,018 WARN L181 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2019-01-01 22:06:13,278 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-01 22:06:13,282 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:06:13,282 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:06:13,282 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:06:13,282 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:06:13,283 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:06:13,283 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:06:13,283 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:06:13,283 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:06:13,283 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11_true-termination.c.i_Iteration5_Lasso [2019-01-01 22:06:13,283 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:06:13,284 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:06:13,288 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:13,294 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:13,297 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:13,299 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:13,300 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:13,304 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:13,307 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:13,309 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:13,313 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:13,314 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:13,316 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:13,317 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:13,318 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:13,321 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:13,323 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:13,325 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:13,327 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:13,330 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:13,332 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:13,334 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:13,340 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:13,534 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-01-01 22:06:13,649 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:13,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:13,653 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:13,655 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:13,657 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:13,659 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:13,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:13,663 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:13,665 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:13,668 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:13,670 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:13,672 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:13,675 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:14,440 WARN L181 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 22:06:14,508 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:06:14,509 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:06:14,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:14,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:14,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:06:14,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,526 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:14,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,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:06:14,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:14,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:14,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,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:06:14,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,533 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:14,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,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:06:14,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:14,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:14,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,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:06:14,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,538 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,539 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:14,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,541 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:14,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,542 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,542 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,543 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:14,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,545 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:14,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,545 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,547 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:14,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,548 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,548 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:14,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,550 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:14,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,552 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:14,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,553 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,554 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:14,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,557 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:14,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,559 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:14,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:06:14,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:06:14,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:06:14,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,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:06:14,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:14,563 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:14,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,568 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:14,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:14,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:14,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,573 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:14,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:14,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:14,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,576 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:14,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:14,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:14,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,579 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:14,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:14,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:14,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,587 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:14,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,588 INFO L205 nArgumentSynthesizer]: 16 stem disjuncts [2019-01-01 22:06:14,588 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:06:14,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,614 INFO L402 nArgumentSynthesizer]: We have 76 Motzkin's Theorem applications. [2019-01-01 22:06:14,614 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 22:06:14,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,708 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:14,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,710 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:14,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:14,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:06:14,714 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:14,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:06:14,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:06:14,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:06:14,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:06:14,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:06:14,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:06:14,749 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:06:14,779 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 22:06:14,779 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 22:06:14,780 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:06:14,780 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:06:14,782 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:06:14,782 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:14,831 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-01-01 22:06:14,845 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 22:06:15,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:15,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:15,455 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-01-01 22:06:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:15,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:15,801 INFO L303 Elim1Store]: Index analysis took 119 ms [2019-01-01 22:06:16,016 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:16,033 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:16,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:16,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:16,484 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:16,486 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 22:06:16,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 22:06:16,536 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:16,536 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2019-01-01 22:06:16,563 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:16,564 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:16,564 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-01 22:06:16,637 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2019-01-01 22:06:16,639 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:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:06:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-01 22:06:16,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2019-01-01 22:06:16,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:16,641 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:06:16,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:16,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:16,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:16,803 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:16,807 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:16,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:16,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:16,854 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:16,856 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 22:06:16,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 22:06:16,900 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:16,901 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2019-01-01 22:06:16,928 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:16,928 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:16,928 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-01 22:06:16,992 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2019-01-01 22:06:16,995 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:16,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:06:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-01 22:06:16,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2019-01-01 22:06:16,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:16,997 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 22:06:17,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:06:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:17,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:06:17,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:06:17,174 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:17,200 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:17,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:06:17,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 22:06:17,266 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:17,268 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 22:06:17,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 22:06:17,315 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:17,315 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2019-01-01 22:06:17,337 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:17,338 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:17,338 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-01 22:06:17,436 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 68 states and 78 transitions. Complement of second has 15 states. [2019-01-01 22:06:17,439 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:17,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 22:06:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2019-01-01 22:06:17,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2019-01-01 22:06:17,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:17,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2019-01-01 22:06:17,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:17,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 6 letters. [2019-01-01 22:06:17,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:06:17,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2019-01-01 22:06:17,443 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:06:17,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2019-01-01 22:06:17,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:06:17,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:06:17,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:06:17,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:06:17,444 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:06:17,444 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:06:17,444 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:06:17,444 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:06:17,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:06:17,448 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:06:17,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:06:17,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:06:17 BoogieIcfgContainer [2019-01-01 22:06:17,455 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:06:17,456 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:06:17,456 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:06:17,456 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:06:17,456 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:56" (3/4) ... [2019-01-01 22:06:17,460 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:06:17,460 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:06:17,461 INFO L168 Benchmark]: Toolchain (without parser) took 22130.84 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 347.6 MB). Free memory was 951.4 MB in the beginning and 954.5 MB in the end (delta: -3.1 MB). Peak memory consumption was 344.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:17,462 INFO L168 Benchmark]: CDTParser took 0.56 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:17,462 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.90 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 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:17,463 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.41 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:17,463 INFO L168 Benchmark]: Boogie Preprocessor took 48.79 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 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:17,464 INFO L168 Benchmark]: RCFGBuilder took 495.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:17,465 INFO L168 Benchmark]: BuchiAutomizer took 21162.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 203.4 MB). Free memory was 1.1 GB in the beginning and 954.5 MB in the end (delta: 165.1 MB). Peak memory consumption was 368.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:06:17,466 INFO L168 Benchmark]: Witness Printer took 4.71 ms. Allocated memory is still 1.4 GB. Free memory is still 954.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:06:17,470 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.56 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 367.90 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 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 46.41 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 48.79 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 495.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -184.4 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21162.73 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 203.4 MB). Free memory was 1.1 GB in the beginning and 954.5 MB in the end (delta: 165.1 MB). Peak memory consumption was 368.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.71 ms. Allocated memory is still 1.4 GB. Free memory is still 954.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 8 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 16.1s. Construction of modules took 0.5s. Büchi inclusion checks took 4.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 82 SDtfs, 58 SDslu, 140 SDs, 0 SdLazy, 250 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital385 mio100 ax100 hnf100 lsp98 ukn41 mio100 lsp29 div100 bol100 ite100 ukn100 eq197 hnf88 smp100 dnf386 smp88 tf100 neg86 sie151 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 116ms 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...