./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 20fbdf1deafb883d59b25bfdcd58a0b89c69ce87 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:12:23,746 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:12:23,748 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:12:23,764 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:12:23,765 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:12:23,766 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:12:23,770 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:12:23,772 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:12:23,774 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:12:23,775 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:12:23,776 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:12:23,776 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:12:23,777 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:12:23,778 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:12:23,779 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:12:23,780 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:12:23,781 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:12:23,783 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:12:23,785 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:12:23,786 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:12:23,787 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:12:23,789 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:12:23,791 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:12:23,792 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:12:23,792 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:12:23,793 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:12:23,794 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:12:23,795 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:12:23,796 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:12:23,797 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:12:23,797 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:12:23,798 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:12:23,798 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:12:23,798 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:12:23,799 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:12:23,800 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:12:23,800 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:12:23,820 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:12:23,821 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:12:23,822 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:12:23,822 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:12:23,822 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:12:23,823 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:12:23,823 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:12:23,823 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:12:23,823 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:12:23,823 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:12:23,823 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:12:23,826 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:12:23,827 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:12:23,827 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:12:23,827 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:12:23,827 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:12:23,827 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:12:23,828 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:12:23,828 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:12:23,828 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:12:23,828 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:12:23,828 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:12:23,828 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:12:23,829 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:12:23,829 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:12:23,829 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:12:23,832 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:12:23,832 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:12:23,832 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:12:23,832 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:12:23,832 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:12:23,833 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:12:23,834 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20fbdf1deafb883d59b25bfdcd58a0b89c69ce87 [2018-11-29 00:12:23,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:12:23,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:12:23,886 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:12:23,888 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:12:23,888 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:12:23,889 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-11-29 00:12:23,950 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9a6628c/8deda847c1c646be989791ec923033af/FLAGf96db1788 [2018-11-29 00:12:24,506 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:12:24,507 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-11-29 00:12:24,528 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9a6628c/8deda847c1c646be989791ec923033af/FLAGf96db1788 [2018-11-29 00:12:24,732 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9a6628c/8deda847c1c646be989791ec923033af [2018-11-29 00:12:24,738 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:12:24,740 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:12:24,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:12:24,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:12:24,748 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:12:24,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:12:24" (1/1) ... [2018-11-29 00:12:24,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26e066d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:24, skipping insertion in model container [2018-11-29 00:12:24,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:12:24" (1/1) ... [2018-11-29 00:12:24,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:12:24,828 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:12:25,301 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:12:25,324 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:12:25,477 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:12:25,576 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:12:25,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:25 WrapperNode [2018-11-29 00:12:25,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:12:25,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:12:25,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:12:25,578 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:12:25,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:25" (1/1) ... [2018-11-29 00:12:25,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:25" (1/1) ... [2018-11-29 00:12:25,659 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:12:25,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:12:25,660 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:12:25,660 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:12:25,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:25" (1/1) ... [2018-11-29 00:12:25,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:25" (1/1) ... [2018-11-29 00:12:25,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:25" (1/1) ... [2018-11-29 00:12:25,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:25" (1/1) ... [2018-11-29 00:12:25,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:25" (1/1) ... [2018-11-29 00:12:25,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:25" (1/1) ... [2018-11-29 00:12:25,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:25" (1/1) ... [2018-11-29 00:12:25,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:12:25,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:12:25,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:12:25,696 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:12:25,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:25" (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-29 00:12:25,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:12:25,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-29 00:12:25,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-11-29 00:12:25,780 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-11-29 00:12:25,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-29 00:12:25,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-29 00:12:25,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:12:25,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:12:25,942 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-29 00:12:26,247 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:12:26,248 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-11-29 00:12:26,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:12:26 BoogieIcfgContainer [2018-11-29 00:12:26,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:12:26,249 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:12:26,249 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:12:26,254 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:12:26,255 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:12:26,255 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:12:24" (1/3) ... [2018-11-29 00:12:26,256 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a2747ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:12:26, skipping insertion in model container [2018-11-29 00:12:26,257 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:12:26,258 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:12:25" (2/3) ... [2018-11-29 00:12:26,258 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a2747ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:12:26, skipping insertion in model container [2018-11-29 00:12:26,258 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:12:26,258 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:12:26" (3/3) ... [2018-11-29 00:12:26,261 INFO L375 chiAutomizerObserver]: Analyzing ICFG memleaks_test22_2_false-valid-memtrack_true-termination.i [2018-11-29 00:12:26,324 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:12:26,325 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:12:26,325 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:12:26,325 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:12:26,325 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:12:26,325 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:12:26,326 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:12:26,326 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:12:26,326 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:12:26,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-29 00:12:26,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-29 00:12:26,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:12:26,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:12:26,381 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:12:26,381 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-29 00:12:26,382 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:12:26,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-29 00:12:26,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-29 00:12:26,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:12:26,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:12:26,385 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:12:26,385 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-29 00:12:26,391 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 10#L-1true havoc entry_point_#t~ret38.base, entry_point_#t~ret38.offset, entry_point_~kobj~2.base, entry_point_~kobj~2.offset;havoc entry_point_~kobj~2.base, entry_point_~kobj~2.offset;havoc ldv_kobject_create_#res.base, ldv_kobject_create_#res.offset;havoc ldv_kobject_create_#t~ret34.base, ldv_kobject_create_#t~ret34.offset, ldv_kobject_create_#t~memset~res35.base, ldv_kobject_create_#t~memset~res35.offset, ldv_kobject_create_~kobj~1.base, ldv_kobject_create_~kobj~1.offset;havoc ldv_kobject_create_~kobj~1.base, ldv_kobject_create_~kobj~1.offset;ldv_malloc_#in~size := 16;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 17#L1073true assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.alloc(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 12#L1076true ldv_kobject_create_#t~ret34.base, ldv_kobject_create_#t~ret34.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;ldv_kobject_create_~kobj~1.base, ldv_kobject_create_~kobj~1.offset := ldv_kobject_create_#t~ret34.base, ldv_kobject_create_#t~ret34.offset;havoc ldv_kobject_create_#t~ret34.base, ldv_kobject_create_#t~ret34.offset; 7#L1409true assume !(ldv_kobject_create_~kobj~1.base == 0 && ldv_kobject_create_~kobj~1.offset == 0); 4#L1411true call ldv_kobject_create_#t~memset~res35.base, ldv_kobject_create_#t~memset~res35.offset := #Ultimate.C_memset(ldv_kobject_create_~kobj~1.base, ldv_kobject_create_~kobj~1.offset, 0, 16);< 5##Ultimate.C_memsetENTRYtrue assume 1 == #valid[#ptr.base];assume #amount + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; 11#$Ultimate##0true #t~loopctr39 := 0; 21#L-1-1true [2018-11-29 00:12:26,392 INFO L796 eck$LassoCheckResult]: Loop: 21#L-1-1true assume #t~loopctr39 < #amount;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#ptr.base,#ptr.offset + #t~loopctr39 := 0], #memory_$Pointer$.offset[#ptr.base,#ptr.offset + #t~loopctr39 := #value % 256];#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr39 := #value];#t~loopctr39 := 1 + #t~loopctr39; 21#L-1-1true [2018-11-29 00:12:26,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:26,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1711261919, now seen corresponding path program 1 times [2018-11-29 00:12:26,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:26,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:26,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:26,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:26,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:26,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:26,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:26,614 INFO L82 PathProgramCache]: Analyzing trace with hash 36, now seen corresponding path program 1 times [2018-11-29 00:12:26,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:26,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:26,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:26,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:26,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:26,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:26,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1509511932, now seen corresponding path program 1 times [2018-11-29 00:12:26,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:12:26,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:12:26,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:26,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:12:26,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:12:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:12:26,984 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-29 00:12:27,665 WARN L180 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2018-11-29 00:12:28,175 WARN L180 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-11-29 00:12:28,617 WARN L180 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-11-29 00:12:28,741 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-11-29 00:12:28,753 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:12:28,754 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:12:28,755 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:12:28,755 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:12:28,755 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:12:28,755 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:12:28,755 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:12:28,755 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:12:28,756 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test22_2_false-valid-memtrack_true-termination.i_Iteration1_Lasso [2018-11-29 00:12:28,756 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:12:28,756 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:12:28,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:28,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:28,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:28,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:28,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:28,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:28,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:28,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:28,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:28,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:28,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:28,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:28,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:28,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:28,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:28,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,097 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2018-11-29 00:12:29,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:12:29,782 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:12:29,788 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:12:29,791 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-29 00:12:29,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,803 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-29 00:12:29,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,809 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-29 00:12:29,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,815 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-29 00:12:29,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,821 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-29 00:12:29,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,826 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-29 00:12:29,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,832 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-29 00:12:29,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,837 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-29 00:12:29,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,843 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-29 00:12:29,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,849 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-29 00:12:29,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,852 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,854 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-29 00:12:29,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:29,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,867 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-29 00:12:29,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,872 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-29 00:12:29,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:29,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,882 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-29 00:12:29,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,887 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-29 00:12:29,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:12:29,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,893 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:12:29,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:12:29,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,896 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-29 00:12:29,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:29,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,917 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-29 00:12:29,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,918 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:12:29,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,920 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:12:29,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,935 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-29 00:12:29,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:29,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,952 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-29 00:12:29,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:29,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,966 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-29 00:12:29,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,969 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:29,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,975 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-29 00:12:29,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:29,977 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,981 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-29 00:12:29,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:29,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,989 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-29 00:12:29,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:29,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:29,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:29,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:29,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:29,998 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-29 00:12:29,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:29,998 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:12:29,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:29,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:30,000 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:12:30,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:30,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:12:30,006 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-29 00:12:30,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:12:30,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:12:30,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:12:30,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:12:30,009 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:12:30,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:12:30,036 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:12:30,079 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-29 00:12:30,080 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-29 00:12:30,083 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:12:30,086 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:12:30,086 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:12:30,087 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(#Ultimate.C_memset_#amount, #Ultimate.C_memset_#t~loopctr39) = 1*#Ultimate.C_memset_#amount - 1*#Ultimate.C_memset_#t~loopctr39 Supporting invariants [] [2018-11-29 00:12:30,195 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-29 00:12:30,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #amount [2018-11-29 00:12:30,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:12:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:30,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:12:30,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:12:30,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-29 00:12:30,320 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-29 00:12:30,322 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 2 states. [2018-11-29 00:12:30,375 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 2 states. Result 25 states and 30 transitions. Complement of second has 6 states. [2018-11-29 00:12:30,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-29 00:12:30,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-29 00:12:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-11-29 00:12:30,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 8 letters. Loop has 1 letters. [2018-11-29 00:12:30,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:30,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 9 letters. Loop has 1 letters. [2018-11-29 00:12:30,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:30,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-29 00:12:30,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:12:30,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2018-11-29 00:12:30,391 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:12:30,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2018-11-29 00:12:30,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:12:30,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:12:30,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:12:30,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:12:30,396 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:30,396 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:30,396 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:12:30,397 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:12:30,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:12:30,397 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:12:30,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:12:30,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:12:30 BoogieIcfgContainer [2018-11-29 00:12:30,404 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:12:30,405 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:12:30,405 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:12:30,405 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:12:30,405 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:12:26" (3/4) ... [2018-11-29 00:12:30,410 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:12:30,410 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:12:30,411 INFO L168 Benchmark]: Toolchain (without parser) took 5671.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 952.7 MB in the beginning and 740.5 MB in the end (delta: 212.2 MB). Peak memory consumption was 291.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:30,412 INFO L168 Benchmark]: CDTParser took 0.19 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-29 00:12:30,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 836.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -104.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:30,415 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:30,415 INFO L168 Benchmark]: Boogie Preprocessor took 35.78 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:12:30,416 INFO L168 Benchmark]: RCFGBuilder took 553.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:30,417 INFO L168 Benchmark]: BuchiAutomizer took 4154.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 740.5 MB in the end (delta: 284.4 MB). Peak memory consumption was 284.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:12:30,417 INFO L168 Benchmark]: Witness Printer took 5.47 ms. Allocated memory is still 1.1 GB. Free memory is still 740.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:12:30,425 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.19 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 836.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -104.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 81.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.78 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 553.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4154.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 740.5 MB in the end (delta: 284.4 MB). Peak memory consumption was 284.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.47 ms. Allocated memory is still 1.1 GB. Free memory is still 740.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #amount * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#amount-unknown + -1 * aux-#t~loopctr39-aux and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.1s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13 SDtfs, 13 SDslu, 1 SDs, 0 SdLazy, 6 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital170 mio100 ax117 hnf101 lsp80 ukn50 mio100 lsp28 div100 bol100 ite100 ukn100 eq200 hnf89 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...