./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11C_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11C_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 faaae9aa069653e753b732f00a89bd7a139fa132 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:24:12,393 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:24:12,395 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:24:12,408 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:24:12,409 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:24:12,410 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:24:12,411 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:24:12,413 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:24:12,416 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:24:12,416 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:24:12,417 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:24:12,418 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:24:12,419 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:24:12,420 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:24:12,421 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:24:12,423 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:24:12,423 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:24:12,426 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:24:12,428 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:24:12,430 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:24:12,431 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:24:12,433 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:24:12,436 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:24:12,436 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:24:12,436 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:24:12,438 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:24:12,439 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:24:12,440 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:24:12,441 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:24:12,442 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:24:12,442 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:24:12,443 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:24:12,443 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:24:12,444 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:24:12,445 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:24:12,446 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:24:12,446 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:24:12,464 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:24:12,465 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:24:12,466 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:24:12,466 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:24:12,466 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:24:12,467 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:24:12,467 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:24:12,467 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:24:12,467 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:24:12,467 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:24:12,468 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:24:12,469 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:24:12,469 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:24:12,469 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:24:12,469 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:24:12,470 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:24:12,470 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:24:12,470 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:24:12,471 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:24:12,471 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:24:12,471 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:24:12,471 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:24:12,471 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:24:12,472 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:24:12,472 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:24:12,472 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:24:12,472 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:24:12,472 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:24:12,475 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:24:12,475 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 -> faaae9aa069653e753b732f00a89bd7a139fa132 [2018-11-28 23:24:12,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:24:12,526 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:24:12,530 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:24:12,532 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:24:12,533 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:24:12,533 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11C_true-termination.c.i [2018-11-28 23:24:12,597 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8390da1e2/ed79100f72d840a9b3b82f6509064338/FLAG358838220 [2018-11-28 23:24:13,074 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:24:13,076 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-recursive-malloc/rec_malloc_ex11C_true-termination.c.i [2018-11-28 23:24:13,085 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8390da1e2/ed79100f72d840a9b3b82f6509064338/FLAG358838220 [2018-11-28 23:24:13,397 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8390da1e2/ed79100f72d840a9b3b82f6509064338 [2018-11-28 23:24:13,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:24:13,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:24:13,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:24:13,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:24:13,408 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:24:13,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:24:13" (1/1) ... [2018-11-28 23:24:13,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aa48b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:13, skipping insertion in model container [2018-11-28 23:24:13,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:24:13" (1/1) ... [2018-11-28 23:24:13,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:24:13,446 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:24:13,671 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:24:13,691 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:24:13,716 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:24:13,738 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:24:13,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:13 WrapperNode [2018-11-28 23:24:13,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:24:13,740 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:24:13,740 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:24:13,741 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:24:13,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:13" (1/1) ... [2018-11-28 23:24:13,766 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:13" (1/1) ... [2018-11-28 23:24:13,789 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:24:13,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:24:13,789 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:24:13,790 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:24:13,801 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:13" (1/1) ... [2018-11-28 23:24:13,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:13" (1/1) ... [2018-11-28 23:24:13,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:13" (1/1) ... [2018-11-28 23:24:13,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:13" (1/1) ... [2018-11-28 23:24:13,816 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:13" (1/1) ... [2018-11-28 23:24:13,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:13" (1/1) ... [2018-11-28 23:24:13,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:13" (1/1) ... [2018-11-28 23:24:13,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:24:13,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:24:13,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:24:13,831 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:24:13,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:24:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-11-28 23:24:13,964 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-11-28 23:24:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:24:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:24:13,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:24:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:24:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:24:14,360 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:24:14,361 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 23:24:14,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:14 BoogieIcfgContainer [2018-11-28 23:24:14,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:24:14,362 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:24:14,362 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:24:14,366 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:24:14,367 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:14,367 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:24:13" (1/3) ... [2018-11-28 23:24:14,369 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ee79f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:24:14, skipping insertion in model container [2018-11-28 23:24:14,369 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:14,369 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:24:13" (2/3) ... [2018-11-28 23:24:14,369 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ee79f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:24:14, skipping insertion in model container [2018-11-28 23:24:14,369 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:24:14,370 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:14" (3/3) ... [2018-11-28 23:24:14,371 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11C_true-termination.c.i [2018-11-28 23:24:14,445 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:24:14,445 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:24:14,446 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:24:14,446 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:24:14,446 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:24:14,446 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:24:14,446 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:24:14,447 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:24:14,447 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:24:14,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:24:14,493 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:24:14,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:14,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:14,503 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:24:14,503 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:14,503 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:24:14,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-28 23:24:14,505 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:24:14,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:14,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:14,507 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:24:14,507 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:14,514 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 7#L31-3true [2018-11-28 23:24:14,515 INFO L796 eck$LassoCheckResult]: Loop: 7#L31-3true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 10#L31-1true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 18#L35true assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 8#L39true 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); 12#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; 17#recFINALtrue assume true; 15#recEXITtrue >#44#return; 6#L39-1true assume -1 == main_#t~ret12;main_#t~ite13 := -1; 20#L39-3true call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 7#L31-3true [2018-11-28 23:24:14,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:14,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2018-11-28 23:24:14,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:14,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:14,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:14,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:14,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:14,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:14,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2107477180, now seen corresponding path program 1 times [2018-11-28 23:24:14,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:14,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:14,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:14,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:14,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:14,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:14,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:24:14,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 23:24:14,993 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:24:15,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:24:15,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:24:15,011 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2018-11-28 23:24:15,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:15,383 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-11-28 23:24:15,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:24:15,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-11-28 23:24:15,390 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:24:15,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 19 transitions. [2018-11-28 23:24:15,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 23:24:15,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 23:24:15,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-11-28 23:24:15,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:15,402 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 23:24:15,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-11-28 23:24:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-28 23:24:15,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 23:24:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-11-28 23:24:15,436 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 23:24:15,436 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 23:24:15,437 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:24:15,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-11-28 23:24:15,438 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-28 23:24:15,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:15,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:15,439 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:24:15,439 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:15,439 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 62#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 57#L31-3 [2018-11-28 23:24:15,440 INFO L796 eck$LassoCheckResult]: Loop: 57#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 58#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 61#L35 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#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 51#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 54#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 53#L18 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; 63#recFINAL assume true; 65#recEXIT >#42#return; 59#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 60#recFINAL assume true; 66#recEXIT >#44#return; 55#L39-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 56#L39-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 57#L31-3 [2018-11-28 23:24:15,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:15,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2018-11-28 23:24:15,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:15,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:15,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:15,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:15,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:15,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:15,472 INFO L82 PathProgramCache]: Analyzing trace with hash 290320444, now seen corresponding path program 1 times [2018-11-28 23:24:15,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:15,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:15,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:15,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:15,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:15,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:15,620 INFO L82 PathProgramCache]: Analyzing trace with hash -645910274, now seen corresponding path program 1 times [2018-11-28 23:24:15,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:15,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:15,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:15,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:15,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:15,918 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-28 23:24:16,094 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-28 23:24:16,820 WARN L180 SmtUtils]: Spent 721.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-11-28 23:24:17,094 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-11-28 23:24:17,216 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-11-28 23:24:17,783 WARN L180 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 119 [2018-11-28 23:24:17,925 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-11-28 23:24:18,038 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:18,039 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:18,039 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:18,039 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:18,039 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:18,040 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:18,040 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:18,040 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:18,040 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:24:18,040 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:18,041 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:18,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:18,571 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2018-11-28 23:24:18,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:19,006 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:19,012 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:19,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,029 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:19,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:19,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:19,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:19,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:19,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:19,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:19,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:19,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:19,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:19,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:19,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:19,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:19,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:19,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:19,119 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:19,119 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:19,134 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:19,146 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:24:19,146 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:24:19,148 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:19,150 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:19,150 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:19,151 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2018-11-28 23:24:19,196 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:24:19,209 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:24:19,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:19,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:19,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:19,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:19,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:19,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-28 23:24:19,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:19,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-28 23:24:19,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 23:24:19,547 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:19,667 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:19,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:19,753 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:36, output treesize:15 [2018-11-28 23:24:19,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-28 23:24:19,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-28 23:24:19,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:19,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:19,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:19,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2018-11-28 23:24:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-28 23:24:19,907 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-28 23:24:19,908 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-28 23:24:20,113 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 62 states and 73 transitions. Complement of second has 17 states. [2018-11-28 23:24:20,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:20,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:24:20,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-11-28 23:24:20,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 16 letters. [2018-11-28 23:24:20,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:20,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 16 letters. [2018-11-28 23:24:20,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:20,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 32 letters. [2018-11-28 23:24:20,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:20,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. [2018-11-28 23:24:20,126 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-28 23:24:20,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 67 transitions. [2018-11-28 23:24:20,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-28 23:24:20,130 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-28 23:24:20,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2018-11-28 23:24:20,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:20,130 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-11-28 23:24:20,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2018-11-28 23:24:20,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2018-11-28 23:24:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-28 23:24:20,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2018-11-28 23:24:20,138 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-11-28 23:24:20,138 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-11-28 23:24:20,139 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:24:20,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2018-11-28 23:24:20,141 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-28 23:24:20,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:20,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:20,141 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:20,142 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:24:20,142 INFO L794 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 265#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 266#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 254#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 288#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 255#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 256#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 287#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 240#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2018-11-28 23:24:20,142 INFO L796 eck$LassoCheckResult]: Loop: 238#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 241#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 239#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2018-11-28 23:24:20,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:20,142 INFO L82 PathProgramCache]: Analyzing trace with hash -498407605, now seen corresponding path program 1 times [2018-11-28 23:24:20,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:20,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:20,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:20,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:20,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:20,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:20,181 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2018-11-28 23:24:20,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:20,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:20,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:20,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:20,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:20,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:20,197 INFO L82 PathProgramCache]: Analyzing trace with hash -359018118, now seen corresponding path program 2 times [2018-11-28 23:24:20,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:20,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:20,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:20,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:20,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:20,471 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-11-28 23:24:20,887 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2018-11-28 23:24:21,303 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 91 [2018-11-28 23:24:21,828 WARN L180 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 105 [2018-11-28 23:24:21,975 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-28 23:24:21,987 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:21,988 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:21,988 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:21,988 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:21,988 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:21,988 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:21,988 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:21,988 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:21,989 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:24:21,989 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:21,989 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:22,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:22,316 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2018-11-28 23:24:22,868 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:22,868 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:22,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:22,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:22,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:22,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:22,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:22,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:22,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:22,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:22,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:22,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:22,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:22,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:22,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:22,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,894 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:22,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:22,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:22,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:22,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:22,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:22,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:22,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:22,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:22,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:22,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:22,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:22,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:22,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:22,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:22,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:22,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:22,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:22,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:22,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:22,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:22,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:22,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:22,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:22,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:22,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:22,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:22,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:22,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:22,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:22,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:22,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:22,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:22,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:22,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:22,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:22,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:22,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:22,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:22,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:22,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:22,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:22,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:22,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:22,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:22,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:22,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:22,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:22,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:22,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:22,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:22,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:22,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:22,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:22,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:22,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:22,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:22,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:22,998 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:22,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:22,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:23,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:23,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:23,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:23,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:23,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:23,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:23,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:23,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:23,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:23,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:23,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:23,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:23,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:23,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:23,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:23,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:23,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:23,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:23,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:23,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:23,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:23,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:23,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:23,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:23,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:23,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:23,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:23,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:23,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:23,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:23,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:23,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:23,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:23,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:23,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:23,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:23,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:23,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:23,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:23,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:23,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:23,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:23,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:23,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:23,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:23,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:23,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:23,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:23,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:23,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:23,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:23,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:23,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:23,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:23,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:23,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:23,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:23,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:23,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:23,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:23,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:23,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:23,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:23,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:23,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:23,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:23,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:23,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:23,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:23,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:23,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:23,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:23,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:23,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:23,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:23,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:23,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:23,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:23,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:23,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:23,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:23,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:23,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:23,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:23,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:23,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:23,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:23,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:23,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:23,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:23,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:23,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:23,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:23,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:23,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:23,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:23,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:23,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:23,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:23,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:23,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:23,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:23,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:23,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:23,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:23,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:23,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:23,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:23,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:23,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:23,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:23,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:23,086 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:23,086 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:23,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:23,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:23,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:23,090 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:24:23,090 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:24:23,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:23,095 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-28 23:24:23,095 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 23:24:23,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:23,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:23,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:23,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:23,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:23,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:23,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:23,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:23,148 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:23,164 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:24:23,164 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 23:24:23,165 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:23,166 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:23,166 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:23,166 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2018-11-28 23:24:23,215 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-28 23:24:23,232 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:24:23,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:23,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:23,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:23,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-28 23:24:23,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-28 23:24:23,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:23,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:23,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-28 23:24:23,587 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 23:24:23,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:24:23,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 23:24:23,631 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-28 23:24:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:23,695 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:24:23,695 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-28 23:24:23,860 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 99 states and 122 transitions. Complement of second has 17 states. [2018-11-28 23:24:23,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:23,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:24:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-28 23:24:23,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-28 23:24:23,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:23,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-28 23:24:23,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:23,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-28 23:24:23,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:23,863 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2018-11-28 23:24:23,867 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-28 23:24:23,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 110 transitions. [2018-11-28 23:24:23,871 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-28 23:24:23,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-28 23:24:23,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2018-11-28 23:24:23,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:23,871 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2018-11-28 23:24:23,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2018-11-28 23:24:23,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-11-28 23:24:23,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-28 23:24:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2018-11-28 23:24:23,883 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-11-28 23:24:23,883 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-11-28 23:24:23,883 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:24:23,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 102 transitions. [2018-11-28 23:24:23,885 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-28 23:24:23,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:23,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:23,887 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:23,887 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:23,887 INFO L794 eck$LassoCheckResult]: Stem: 504#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 503#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 481#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 483#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 500#L35 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#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 520#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 547#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 471#L18 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; 502#recFINAL assume true; 510#recEXIT >#42#return; 523#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 521#recFINAL assume true; 518#recEXIT >#44#return; 477#L39-1 assume !(-1 == main_#t~ret12);main_#t~ite13 := 1; 478#L39-3 [2018-11-28 23:24:23,887 INFO L796 eck$LassoCheckResult]: Loop: 478#L39-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 513#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 524#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 522#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 498#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 499#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 533#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 528#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 499#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 533#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; 534#recFINAL assume true; 541#recEXIT >#42#return; 529#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 530#recFINAL assume true; 527#recEXIT >#44#return; 517#L39-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 478#L39-3 [2018-11-28 23:24:23,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:23,888 INFO L82 PathProgramCache]: Analyzing trace with hash -713572475, now seen corresponding path program 1 times [2018-11-28 23:24:23,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:23,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:23,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:23,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:23,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:24,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:24:24,143 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:24:24,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:24,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:24,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-28 23:24:24,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-28 23:24:24,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:24,317 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:24,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 33 [2018-11-28 23:24:24,345 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 23:24:24,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:24:24,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 23:24:24,647 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:25, output treesize:31 [2018-11-28 23:24:24,712 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 23:24:24,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:24,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-28 23:24:24,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-28 23:24:24,737 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:24,758 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:24,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:24:24,760 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:51, output treesize:5 [2018-11-28 23:24:24,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:24,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:24:24,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-11-28 23:24:24,804 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:24:24,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:24,805 INFO L82 PathProgramCache]: Analyzing trace with hash 542882406, now seen corresponding path program 2 times [2018-11-28 23:24:24,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:24,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:24,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:24,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:24:24,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:24,948 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 23:24:25,474 WARN L180 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-11-28 23:24:26,116 WARN L180 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 118 [2018-11-28 23:24:26,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:24:26,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:24:26,212 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. cyclomatic complexity: 26 Second operand 13 states. [2018-11-28 23:24:26,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:24:26,357 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2018-11-28 23:24:26,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:24:26,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 110 transitions. [2018-11-28 23:24:26,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:24:26,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 54 states and 67 transitions. [2018-11-28 23:24:26,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 23:24:26,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 23:24:26,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 67 transitions. [2018-11-28 23:24:26,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:24:26,365 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. [2018-11-28 23:24:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 67 transitions. [2018-11-28 23:24:26,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-11-28 23:24:26,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 23:24:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-11-28 23:24:26,371 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-28 23:24:26,371 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-28 23:24:26,371 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:24:26,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2018-11-28 23:24:26,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:24:26,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:24:26,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:24:26,373 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:24:26,373 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:24:26,374 INFO L794 eck$LassoCheckResult]: Stem: 732#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 731#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.alloc(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 716#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 717#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 749#L35 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 725#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 726#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 740#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 722#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 745#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 729#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; 730#recFINAL assume true; 750#recEXIT >#42#return; 738#L18-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~res~0; 737#recFINAL assume true; 736#recEXIT >#44#return; 714#L39-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 715#L39-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 718#L31-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 720#L31-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 727#L35 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#L39 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 706#recENTRY [2018-11-28 23:24:26,374 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.alloc(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 707#L18 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 706#recENTRY [2018-11-28 23:24:26,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:26,374 INFO L82 PathProgramCache]: Analyzing trace with hash -873815595, now seen corresponding path program 2 times [2018-11-28 23:24:26,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:26,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:26,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:26,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:26,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:26,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:26,412 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 2 times [2018-11-28 23:24:26,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:26,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:26,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:26,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:26,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:26,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:26,426 INFO L82 PathProgramCache]: Analyzing trace with hash -43609424, now seen corresponding path program 3 times [2018-11-28 23:24:26,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:24:26,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:24:26,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:26,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:24:26,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:24:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:24:27,218 WARN L180 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-11-28 23:24:27,798 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-11-28 23:24:29,360 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 225 DAG size of output: 194 [2018-11-28 23:24:29,717 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-11-28 23:24:30,121 WARN L180 SmtUtils]: Spent 392.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-11-28 23:24:30,347 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2018-11-28 23:24:30,350 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:24:30,350 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:24:30,350 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:24:30,350 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:24:30,351 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:24:30,351 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:24:30,351 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:24:30,351 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:24:30,351 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11C_true-termination.c.i_Iteration5_Lasso [2018-11-28 23:24:30,351 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:24:30,352 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:24:30,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,619 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2018-11-28 23:24:30,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:30,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:24:31,255 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:24:31,256 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:24:31,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:31,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:31,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:31,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:31,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:31,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:31,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:31,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:31,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:31,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:31,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:31,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:31,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:31,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:31,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:31,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:31,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:31,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:31,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:31,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:31,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:31,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:31,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:31,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:31,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:31,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:31,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:31,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:31,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:31,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:31,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:31,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:31,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:31,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:31,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:31,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:31,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:31,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:31,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:31,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:31,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:31,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:31,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:31,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:31,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:31,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:31,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:31,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:31,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:31,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:31,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:31,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:31,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:31,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:31,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:31,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:31,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:31,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:31,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:31,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:31,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:31,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:31,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:31,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:31,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:31,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:31,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:31,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:31,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:31,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:31,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:31,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:31,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:31,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:31,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:31,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:31,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:31,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:31,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:31,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:31,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:31,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:31,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:31,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:31,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:31,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:31,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:31,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:31,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:31,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:31,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:31,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:31,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:31,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:31,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:31,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:31,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:31,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:31,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:31,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:31,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:31,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:31,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:31,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:31,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:31,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:31,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:31,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:31,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:31,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:31,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:31,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:31,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:31,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:31,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:31,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:31,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:31,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:31,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:31,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:31,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:31,288 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:31,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:31,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:31,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:31,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:31,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:31,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:31,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:31,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:31,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:31,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:31,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:31,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:31,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:31,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:24:31,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:31,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:31,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:31,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:24:31,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:24:31,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:31,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:31,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:31,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:31,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:31,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:31,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:31,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:31,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:31,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:31,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:31,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:31,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:31,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:31,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:31,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:31,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:31,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:31,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:31,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:31,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:31,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:31,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:31,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:31,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:24:31,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:24:31,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:24:31,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:24:31,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:24:31,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:24:31,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:24:31,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:24:31,313 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:24:31,316 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:24:31,316 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:24:31,317 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:24:31,318 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:24:31,318 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:24:31,318 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 [] [2018-11-28 23:24:31,344 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 23:24:31,357 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:24:31,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:31,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:31,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:31,982 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2018-11-28 23:24:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:32,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:32,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-28 23:24:32,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-28 23:24:32,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:32,216 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:32,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-28 23:24:32,228 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 23:24:32,255 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:24:32,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 23:24:32,276 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-28 23:24:32,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:32,304 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 [2018-11-28 23:24:32,305 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 23:24:32,375 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. [2018-11-28 23:24:32,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:24:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-28 23:24:32,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-28 23:24:32,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:32,379 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:24:32,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:32,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:32,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:32,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-28 23:24:32,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-28 23:24:32,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:32,608 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:32,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-28 23:24:32,638 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 23:24:32,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:24:32,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 23:24:32,685 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-28 23:24:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:32,708 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 [2018-11-28 23:24:32,709 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 23:24:32,794 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. [2018-11-28 23:24:32,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:32,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:24:32,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-28 23:24:32,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-28 23:24:32,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:32,797 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:24:32,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:24:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:32,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:24:32,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:24:32,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-11-28 23:24:32,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-11-28 23:24:32,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:24:33,005 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:24:33,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 40 [2018-11-28 23:24:33,016 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 23:24:33,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:24:33,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 23:24:33,059 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-28 23:24:33,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:24:33,103 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 [2018-11-28 23:24:33,104 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 23:24:33,202 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. [2018-11-28 23:24:33,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:24:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:24:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2018-11-28 23:24:33,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-28 23:24:33,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:33,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2018-11-28 23:24:33,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:33,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-28 23:24:33,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:24:33,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2018-11-28 23:24:33,208 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:24:33,209 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2018-11-28 23:24:33,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:24:33,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:24:33,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:24:33,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:24:33,209 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:33,209 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:33,209 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:24:33,209 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:24:33,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:24:33,210 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:24:33,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:24:33,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:24:33 BoogieIcfgContainer [2018-11-28 23:24:33,217 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:24:33,218 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:24:33,218 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:24:33,218 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:24:33,218 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:24:14" (3/4) ... [2018-11-28 23:24:33,223 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:24:33,223 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:24:33,224 INFO L168 Benchmark]: Toolchain (without parser) took 19822.59 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 353.4 MB). Free memory was 951.3 MB in the beginning and 1.3 GB in the end (delta: -324.8 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:33,225 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:33,225 INFO L168 Benchmark]: CACSL2BoogieTranslator took 336.31 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:33,226 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.76 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:33,227 INFO L168 Benchmark]: Boogie Preprocessor took 40.79 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:33,227 INFO L168 Benchmark]: RCFGBuilder took 531.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:33,228 INFO L168 Benchmark]: BuchiAutomizer took 18855.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 232.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -180.4 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:24:33,229 INFO L168 Benchmark]: Witness Printer took 5.35 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:24:33,241 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 336.31 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.76 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 40.79 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 531.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18855.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 232.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -180.4 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.35 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 8 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][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 18.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 14.6s. Construction of modules took 0.6s. Büchi inclusion checks took 3.2s. 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, 139 SDs, 0 SdLazy, 251 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital373 mio100 ax100 hnf100 lsp98 ukn39 mio100 lsp27 div100 bol100 ite100 ukn100 eq192 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...