./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 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/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-2e94e6a [2019-01-02 00:22:51,012 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:22:51,013 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:22:51,032 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:22:51,032 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:22:51,033 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:22:51,037 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:22:51,040 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:22:51,041 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:22:51,050 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:22:51,051 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:22:51,051 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:22:51,053 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:22:51,054 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:22:51,057 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:22:51,058 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:22:51,059 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:22:51,060 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:22:51,064 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:22:51,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:22:51,069 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:22:51,070 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:22:51,076 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:22:51,076 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:22:51,076 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:22:51,078 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:22:51,080 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:22:51,081 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:22:51,082 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:22:51,083 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:22:51,083 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:22:51,085 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:22:51,086 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:22:51,086 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:22:51,087 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:22:51,087 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:22:51,088 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:22:51,115 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:22:51,115 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:22:51,117 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:22:51,118 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:22:51,118 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:22:51,118 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:22:51,118 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:22:51,118 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:22:51,119 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:22:51,119 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:22:51,119 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:22:51,119 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:22:51,119 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:22:51,119 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:22:51,120 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:22:51,120 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:22:51,121 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:22:51,121 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:22:51,121 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:22:51,121 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:22:51,121 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:22:51,121 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:22:51,123 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:22:51,123 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:22:51,123 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:22:51,123 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:22:51,124 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:22:51,124 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:22:51,124 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:22:51,124 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:22:51,124 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:22:51,125 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:22:51,126 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 [2019-01-02 00:22:51,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:22:51,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:22:51,210 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:22:51,212 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:22:51,212 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:22:51,213 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i [2019-01-02 00:22:51,269 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92df216c5/8f92386d201747b7aaef8bbd31c89a85/FLAG13696a281 [2019-01-02 00:22:51,853 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:22:51,853 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/memleaks_test22_2_false-valid-memtrack_true-termination.i [2019-01-02 00:22:51,869 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92df216c5/8f92386d201747b7aaef8bbd31c89a85/FLAG13696a281 [2019-01-02 00:22:52,110 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92df216c5/8f92386d201747b7aaef8bbd31c89a85 [2019-01-02 00:22:52,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:22:52,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:22:52,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:22:52,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:22:52,125 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:22:52,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:22:52" (1/1) ... [2019-01-02 00:22:52,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb73b9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:52, skipping insertion in model container [2019-01-02 00:22:52,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:22:52" (1/1) ... [2019-01-02 00:22:52,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:22:52,215 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:22:52,716 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:22:52,740 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:22:52,918 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:22:53,006 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:22:53,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:53 WrapperNode [2019-01-02 00:22:53,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:22:53,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:22:53,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:22:53,009 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:22:53,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:53" (1/1) ... [2019-01-02 00:22:53,051 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:53" (1/1) ... [2019-01-02 00:22:53,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:22:53,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:22:53,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:22:53,092 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:22:53,101 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:53" (1/1) ... [2019-01-02 00:22:53,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:53" (1/1) ... [2019-01-02 00:22:53,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:53" (1/1) ... [2019-01-02 00:22:53,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:53" (1/1) ... [2019-01-02 00:22:53,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:53" (1/1) ... [2019-01-02 00:22:53,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:53" (1/1) ... [2019-01-02 00:22:53,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:53" (1/1) ... [2019-01-02 00:22:53,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:22:53,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:22:53,126 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:22:53,127 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:22:53,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:22:53,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:22:53,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-01-02 00:22:53,205 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-01-02 00:22:53,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-02 00:22:53,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-02 00:22:53,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:22:53,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-02 00:22:53,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:22:53,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:22:53,384 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-02 00:22:53,688 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:22:53,689 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2019-01-02 00:22:53,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:22:53 BoogieIcfgContainer [2019-01-02 00:22:53,689 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:22:53,690 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:22:53,690 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:22:53,694 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:22:53,695 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:22:53,695 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:22:52" (1/3) ... [2019-01-02 00:22:53,696 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73623550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:22:53, skipping insertion in model container [2019-01-02 00:22:53,696 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:22:53,697 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:22:53" (2/3) ... [2019-01-02 00:22:53,697 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@73623550 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:22:53, skipping insertion in model container [2019-01-02 00:22:53,697 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:22:53,698 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:22:53" (3/3) ... [2019-01-02 00:22:53,699 INFO L375 chiAutomizerObserver]: Analyzing ICFG memleaks_test22_2_false-valid-memtrack_true-termination.i [2019-01-02 00:22:53,760 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:22:53,761 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:22:53,761 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:22:53,761 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:22:53,761 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:22:53,761 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:22:53,762 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:22:53,762 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:22:53,762 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:22:53,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-01-02 00:22:53,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-02 00:22:53,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:22:53,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:22:53,816 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:22:53,816 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-02 00:22:53,816 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:22:53,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-01-02 00:22:53,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-02 00:22:53,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:22:53,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:22:53,819 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:22:53,819 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-02 00:22:53,826 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.allocOnStack(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.allocOnHeap(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 [2019-01-02 00:22:53,826 INFO L796 eck$LassoCheckResult]: Loop: 21#L-1-1true assume #t~loopctr39 < #amount;#memory_int := #memory_int[#ptr.base,#ptr.offset + #t~loopctr39 := #value];#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];#t~loopctr39 := 1 + #t~loopctr39; 21#L-1-1true [2019-01-02 00:22:53,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:53,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1711261919, now seen corresponding path program 1 times [2019-01-02 00:22:53,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:53,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:53,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:53,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:53,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:53,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:53,997 INFO L82 PathProgramCache]: Analyzing trace with hash 36, now seen corresponding path program 1 times [2019-01-02 00:22:53,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:53,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:54,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:54,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:54,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:54,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:54,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1509511932, now seen corresponding path program 1 times [2019-01-02 00:22:54,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:22:54,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:22:54,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:54,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:22:54,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:22:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:22:55,042 WARN L181 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2019-01-02 00:22:55,525 WARN L181 SmtUtils]: Spent 466.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-02 00:22:55,995 WARN L181 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2019-01-02 00:22:56,111 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-01-02 00:22:56,123 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:22:56,124 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:22:56,124 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:22:56,126 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:22:56,126 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:22:56,126 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:22:56,126 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:22:56,127 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:22:56,127 INFO L131 ssoRankerPreferences]: Filename of dumped script: memleaks_test22_2_false-valid-memtrack_true-termination.i_Iteration1_Lasso [2019-01-02 00:22:56,127 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:22:56,127 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:22:56,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,618 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-01-02 00:22:56,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:56,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:22:57,540 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:22:57,548 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:22:57,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,568 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:57,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:57,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:57,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:57,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:57,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:57,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:57,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:57,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:57,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:57,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:22:57,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:22:57,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:22:57,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:57,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:57,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,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 [2019-01-02 00:22:57,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,825 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:57,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:57,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,832 INFO L205 nArgumentSynthesizer]: 3 stem disjuncts [2019-01-02 00:22:57,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,837 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-01-02 00:22:57,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:57,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:57,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:57,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:57,889 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:57,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:57,909 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:57,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:57,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:57,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:57,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:57,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:22:57,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:22:57,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:22:57,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:22:57,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:22:57,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:22:57,952 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:22:57,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:22:57,995 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:22:58,037 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-02 00:22:58,039 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-01-02 00:22:58,042 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:22:58,043 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:22:58,044 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:22:58,045 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 [] [2019-01-02 00:22:58,134 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-02 00:22:58,142 WARN L1298 BoogieBacktranslator]: unknown boogie variable #amount [2019-01-02 00:22:58,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:22:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:22:58,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:22:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:22:58,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:22:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:22:58,263 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 [2019-01-02 00:22:58,264 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 2 states. [2019-01-02 00:22:58,314 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. [2019-01-02 00:22:58,315 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 [2019-01-02 00:22:58,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-02 00:22:58,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-01-02 00:22:58,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 8 letters. Loop has 1 letters. [2019-01-02 00:22:58,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:22:58,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 9 letters. Loop has 1 letters. [2019-01-02 00:22:58,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:22:58,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-02 00:22:58,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:22:58,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2019-01-02 00:22:58,327 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:22:58,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2019-01-02 00:22:58,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:22:58,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:22:58,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:22:58,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:22:58,333 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:22:58,333 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:22:58,333 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:22:58,334 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:22:58,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:22:58,334 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:22:58,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:22:58,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:22:58 BoogieIcfgContainer [2019-01-02 00:22:58,340 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:22:58,341 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:22:58,341 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:22:58,341 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:22:58,342 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:22:53" (3/4) ... [2019-01-02 00:22:58,345 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:22:58,345 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:22:58,346 INFO L168 Benchmark]: Toolchain (without parser) took 6230.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.5 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:22:58,347 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:22:58,348 INFO L168 Benchmark]: CACSL2BoogieTranslator took 890.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:22:58,349 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-02 00:22:58,350 INFO L168 Benchmark]: Boogie Preprocessor took 34.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:22:58,350 INFO L168 Benchmark]: RCFGBuilder took 563.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2019-01-02 00:22:58,351 INFO L168 Benchmark]: BuchiAutomizer took 4650.45 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -74.3 MB). Peak memory consumption was 5.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:22:58,352 INFO L168 Benchmark]: Witness Printer took 4.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:22:58,357 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.15 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 890.31 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 563.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4650.45 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -74.3 MB). Peak memory consumption was 5.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 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 #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.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.3s. 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: inital176 mio100 ax117 hnf101 lsp80 ukn52 mio100 lsp26 div100 bol100 ite100 ukn100 eq200 hnf89 smp100 dnf144 smp69 tf100 neg100 sie132 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 3 VariablesLoop: 0 DisjunctsStem: 3 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 10 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...