./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strtol_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_53104885-b4d4-4157-ae58-075d708b0f8d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_53104885-b4d4-4157-ae58-075d708b0f8d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_53104885-b4d4-4157-ae58-075d708b0f8d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_53104885-b4d4-4157-ae58-075d708b0f8d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strtol_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_53104885-b4d4-4157-ae58-075d708b0f8d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_53104885-b4d4-4157-ae58-075d708b0f8d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7d3a15f933181b44751784c7ab9846d6b1216531 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 16:21:05,017 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:21:05,019 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:21:05,025 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:21:05,026 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:21:05,026 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:21:05,027 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:21:05,028 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:21:05,029 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:21:05,030 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:21:05,030 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:21:05,031 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:21:05,031 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:21:05,032 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:21:05,033 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:21:05,033 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:21:05,034 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:21:05,035 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:21:05,036 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:21:05,037 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:21:05,038 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:21:05,039 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:21:05,040 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:21:05,040 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:21:05,041 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:21:05,041 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:21:05,042 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:21:05,042 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:21:05,043 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:21:05,043 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:21:05,043 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:21:05,044 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:21:05,044 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:21:05,044 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:21:05,044 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:21:05,045 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:21:05,045 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_53104885-b4d4-4157-ae58-075d708b0f8d/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 16:21:05,052 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:21:05,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:21:05,053 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:21:05,053 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:21:05,053 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:21:05,054 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 16:21:05,054 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 16:21:05,054 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 16:21:05,054 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 16:21:05,054 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 16:21:05,054 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 16:21:05,054 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:21:05,054 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 16:21:05,055 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:21:05,055 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:21:05,055 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 16:21:05,055 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 16:21:05,055 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 16:21:05,055 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:21:05,055 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 16:21:05,055 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:21:05,056 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 16:21:05,056 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:21:05,056 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:21:05,056 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 16:21:05,056 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:21:05,056 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:21:05,056 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 16:21:05,057 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 16:21:05,057 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_53104885-b4d4-4157-ae58-075d708b0f8d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d3a15f933181b44751784c7ab9846d6b1216531 [2018-11-18 16:21:05,079 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:21:05,088 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:21:05,091 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:21:05,092 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:21:05,092 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:21:05,092 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_53104885-b4d4-4157-ae58-075d708b0f8d/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strtol_true-termination.c.i [2018-11-18 16:21:05,134 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_53104885-b4d4-4157-ae58-075d708b0f8d/bin-2019/uautomizer/data/4c5f93bc7/aac7a4849f2c453698cfcfbf9239f9cf/FLAGc6c304f2a [2018-11-18 16:21:05,553 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:21:05,554 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_53104885-b4d4-4157-ae58-075d708b0f8d/sv-benchmarks/c/termination-libowfat/strtol_true-termination.c.i [2018-11-18 16:21:05,560 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_53104885-b4d4-4157-ae58-075d708b0f8d/bin-2019/uautomizer/data/4c5f93bc7/aac7a4849f2c453698cfcfbf9239f9cf/FLAGc6c304f2a [2018-11-18 16:21:05,571 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_53104885-b4d4-4157-ae58-075d708b0f8d/bin-2019/uautomizer/data/4c5f93bc7/aac7a4849f2c453698cfcfbf9239f9cf [2018-11-18 16:21:05,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:21:05,574 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:21:05,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:21:05,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:21:05,578 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:21:05,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:21:05" (1/1) ... [2018-11-18 16:21:05,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be20a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:05, skipping insertion in model container [2018-11-18 16:21:05,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:21:05" (1/1) ... [2018-11-18 16:21:05,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:21:05,614 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:21:05,813 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:21:05,821 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:21:05,903 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:21:05,934 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:21:05,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:05 WrapperNode [2018-11-18 16:21:05,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:21:05,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:21:05,935 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:21:05,935 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:21:05,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:05" (1/1) ... [2018-11-18 16:21:05,957 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:05" (1/1) ... [2018-11-18 16:21:05,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:21:05,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:21:05,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:21:05,980 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:21:05,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:05" (1/1) ... [2018-11-18 16:21:05,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:05" (1/1) ... [2018-11-18 16:21:05,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:05" (1/1) ... [2018-11-18 16:21:05,992 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:05" (1/1) ... [2018-11-18 16:21:05,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:05" (1/1) ... [2018-11-18 16:21:06,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:05" (1/1) ... [2018-11-18 16:21:06,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:05" (1/1) ... [2018-11-18 16:21:06,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:21:06,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:21:06,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:21:06,008 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:21:06,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_53104885-b4d4-4157-ae58-075d708b0f8d/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:21:06,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 16:21:06,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 16:21:06,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 16:21:06,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 16:21:06,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 16:21:06,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 16:21:06,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:21:06,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:21:06,444 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:21:06,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:21:06 BoogieIcfgContainer [2018-11-18 16:21:06,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:21:06,445 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 16:21:06,445 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 16:21:06,447 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 16:21:06,448 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:21:06,448 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 04:21:05" (1/3) ... [2018-11-18 16:21:06,449 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f30cf94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:21:06, skipping insertion in model container [2018-11-18 16:21:06,449 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:21:06,449 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:21:05" (2/3) ... [2018-11-18 16:21:06,449 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f30cf94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 04:21:06, skipping insertion in model container [2018-11-18 16:21:06,450 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 16:21:06,450 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:21:06" (3/3) ... [2018-11-18 16:21:06,451 INFO L375 chiAutomizerObserver]: Analyzing ICFG strtol_true-termination.c.i [2018-11-18 16:21:06,483 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:21:06,484 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 16:21:06,484 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 16:21:06,484 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 16:21:06,484 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:21:06,484 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:21:06,484 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 16:21:06,485 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:21:06,485 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 16:21:06,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. [2018-11-18 16:21:06,511 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-18 16:21:06,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:21:06,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:21:06,516 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 16:21:06,516 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 16:21:06,516 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 16:21:06,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. [2018-11-18 16:21:06,519 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-18 16:21:06,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:21:06,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:21:06,519 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 16:21:06,519 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 16:21:06,524 INFO L794 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet29, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~nondet31, main_#t~ret32, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~base~0, main_~#end~0.base, main_~#end~0.offset;main_~in_len~0 := main_#t~nondet29;havoc main_#t~nondet29; 44#L562true assume !(main_~in_len~0 < 1);call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~base~0 := main_#t~nondet31;havoc main_#t~nondet31;call main_~#end~0.base, main_~#end~0.offset := #Ultimate.alloc(8);call write~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8);call write~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8);assume { :begin_inline_strtol } true;strtol_#in~nptr.base, strtol_#in~nptr.offset, strtol_#in~endptr.base, strtol_#in~endptr.offset, strtol_#in~base := main_~in~0.base, main_~in~0.offset, main_~#end~0.base, main_~#end~0.offset, main_~base~0;havoc strtol_#res;havoc strtol_#t~post22.base, strtol_#t~post22.offset, strtol_#t~mem21, strtol_#t~mem23, strtol_#t~pre24.base, strtol_#t~pre24.offset, strtol_#t~ret25, strtol_#t~mem26.base, strtol_#t~mem26.offset, strtol_#t~short27, strtol_#t~ite28, strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base, strtol_~neg~1, strtol_~v~1, strtol_~orig~1.base, strtol_~orig~1.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#in~nptr.base, strtol_#in~nptr.offset;strtol_~endptr.base, strtol_~endptr.offset := strtol_#in~endptr.base, strtol_#in~endptr.offset;strtol_~base := strtol_#in~base;strtol_~neg~1 := 0;havoc strtol_~v~1;strtol_~orig~1.base, strtol_~orig~1.offset := strtol_~nptr.base, strtol_~nptr.offset; 19#L554-4true [2018-11-18 16:21:06,524 INFO L796 eck$LassoCheckResult]: Loop: 19#L554-4true assume true; 12#L554-1true call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 15#L554-2true assume !!(32 == strtol_#t~mem21);havoc strtol_#t~mem21;strtol_#t~post22.base, strtol_#t~post22.offset := strtol_~nptr.base, strtol_~nptr.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#t~post22.base, 1 + strtol_#t~post22.offset;havoc strtol_#t~post22.base, strtol_#t~post22.offset; 19#L554-4true [2018-11-18 16:21:06,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:06,528 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-18 16:21:06,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:06,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:06,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:06,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:06,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:06,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:06,615 INFO L82 PathProgramCache]: Analyzing trace with hash 40783, now seen corresponding path program 1 times [2018-11-18 16:21:06,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:06,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:06,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:06,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:06,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:06,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:06,625 INFO L82 PathProgramCache]: Analyzing trace with hash 889570252, now seen corresponding path program 1 times [2018-11-18 16:21:06,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:06,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:06,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:06,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:06,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:06,933 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2018-11-18 16:21:07,016 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:21:07,017 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:21:07,017 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:21:07,017 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:21:07,017 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:21:07,017 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:21:07,018 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:21:07,018 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:21:07,018 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtol_true-termination.c.i_Iteration1_Lasso [2018-11-18 16:21:07,018 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:21:07,018 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:21:07,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,195 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2018-11-18 16:21:07,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:07,518 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:21:07,522 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:21:07,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:07,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:07,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:07,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:07,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:07,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:07,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:07,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:07,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:07,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:07,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:07,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:07,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:07,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:07,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:07,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:07,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:07,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:07,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:07,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:07,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:07,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:07,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:07,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:07,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:07,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:07,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:07,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:07,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:07,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:07,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:07,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:07,534 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:07,534 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:07,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:07,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:07,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:07,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:07,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:07,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:07,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:07,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:07,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:07,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:07,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:07,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:07,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:07,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:07,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:07,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:07,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:07,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:07,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:07,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:07,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:07,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:07,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:07,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:07,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:07,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:07,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 [2018-11-18 16:21:07,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:07,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:07,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:07,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:07,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:07,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:07,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:07,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 [2018-11-18 16:21:07,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:07,567 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:21:07,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:07,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:07,570 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:21:07,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:07,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:07,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:07,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:07,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:07,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:07,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:07,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:07,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:07,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:07,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:07,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:07,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:07,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:07,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:07,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:07,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:07,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:07,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:07,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:07,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:07,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:07,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:07,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:07,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:07,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:07,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:07,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:07,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:07,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:07,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:07,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:07,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:07,607 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:07,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:07,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:07,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:07,612 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 16:21:07,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:07,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:07,613 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 16:21:07,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:07,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:07,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:07,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:07,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:07,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:07,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:07,622 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:07,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:07,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:07,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:07,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:07,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:07,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:07,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:07,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:07,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:07,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:07,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:07,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:07,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:07,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:07,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:07,635 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:07,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:07,658 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:21:07,678 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 16:21:07,679 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 16:21:07,681 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:21:07,682 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:21:07,682 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:21:07,682 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strtol_~nptr.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc30.base)_1) = -1*ULTIMATE.start_strtol_~nptr.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc30.base)_1 Supporting invariants [] [2018-11-18 16:21:07,722 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-11-18 16:21:07,727 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 16:21:07,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:07,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:21:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:07,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:21:07,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:21:07,801 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 16:21:07,802 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states. Second operand 4 states. [2018-11-18 16:21:07,938 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states.. Second operand 4 states. Result 204 states and 319 transitions. Complement of second has 8 states. [2018-11-18 16:21:07,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 16:21:07,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 16:21:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2018-11-18 16:21:07,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-18 16:21:07,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:07,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-18 16:21:07,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:07,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 194 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-18 16:21:07,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:07,944 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 319 transitions. [2018-11-18 16:21:07,948 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2018-11-18 16:21:07,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 66 states and 93 transitions. [2018-11-18 16:21:07,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2018-11-18 16:21:07,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2018-11-18 16:21:07,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 93 transitions. [2018-11-18 16:21:07,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:21:07,955 INFO L705 BuchiCegarLoop]: Abstraction has 66 states and 93 transitions. [2018-11-18 16:21:07,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 93 transitions. [2018-11-18 16:21:07,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 39. [2018-11-18 16:21:07,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 16:21:07,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2018-11-18 16:21:07,974 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2018-11-18 16:21:07,975 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2018-11-18 16:21:07,975 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 16:21:07,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2018-11-18 16:21:07,976 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 16:21:07,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:21:07,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:21:07,976 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:21:07,976 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 16:21:07,976 INFO L794 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 341#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet29, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~nondet31, main_#t~ret32, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~base~0, main_~#end~0.base, main_~#end~0.offset;main_~in_len~0 := main_#t~nondet29;havoc main_#t~nondet29; 342#L562 assume !(main_~in_len~0 < 1);call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~base~0 := main_#t~nondet31;havoc main_#t~nondet31;call main_~#end~0.base, main_~#end~0.offset := #Ultimate.alloc(8);call write~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8);call write~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8);assume { :begin_inline_strtol } true;strtol_#in~nptr.base, strtol_#in~nptr.offset, strtol_#in~endptr.base, strtol_#in~endptr.offset, strtol_#in~base := main_~in~0.base, main_~in~0.offset, main_~#end~0.base, main_~#end~0.offset, main_~base~0;havoc strtol_#res;havoc strtol_#t~post22.base, strtol_#t~post22.offset, strtol_#t~mem21, strtol_#t~mem23, strtol_#t~pre24.base, strtol_#t~pre24.offset, strtol_#t~ret25, strtol_#t~mem26.base, strtol_#t~mem26.offset, strtol_#t~short27, strtol_#t~ite28, strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base, strtol_~neg~1, strtol_~v~1, strtol_~orig~1.base, strtol_~orig~1.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#in~nptr.base, strtol_#in~nptr.offset;strtol_~endptr.base, strtol_~endptr.offset := strtol_#in~endptr.base, strtol_#in~endptr.offset;strtol_~base := strtol_#in~base;strtol_~neg~1 := 0;havoc strtol_~v~1;strtol_~orig~1.base, strtol_~orig~1.offset := strtol_~nptr.base, strtol_~nptr.offset; 357#L554-4 assume true; 343#L554-1 call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 344#L554-2 assume !(32 == strtol_#t~mem21);havoc strtol_#t~mem21; 352#L554-5 call strtol_#t~mem23 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 335#L555 assume !(45 == strtol_#t~mem23);havoc strtol_#t~mem23; 336#L555-2 assume { :begin_inline_strtoul } true;strtoul_#in~ptr.base, strtoul_#in~ptr.offset, strtoul_#in~endptr.base, strtoul_#in~endptr.offset, strtoul_#in~base := strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base;havoc strtoul_#res;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset, strtoul_#t~mem2, strtoul_#t~mem4, strtoul_#t~post5.base, strtoul_#t~post5.offset, strtoul_#t~mem6, strtoul_#t~pre7.base, strtoul_#t~pre7.offset, strtoul_#t~mem8, strtoul_#t~short9, strtoul_~b~0, strtoul_#t~mem10, strtoul_#t~mem11, strtoul_#t~mem12, strtoul_#t~short13, strtoul_#t~mem14, strtoul_#t~ite17, strtoul_#t~ite16, strtoul_#t~ite15, strtoul_~x~0, strtoul_~w~0, strtoul_#t~pre18.base, strtoul_#t~pre18.offset, strtoul_~c~0, strtoul_#t~mem19, strtoul_#t~ite20, strtoul_~ptr.base, strtoul_~ptr.offset, strtoul_~endptr.base, strtoul_~endptr.offset, strtoul_~base, strtoul_~neg~0, strtoul_~v~0, strtoul_~orig~0.base, strtoul_~orig~0.offset, strtoul_~nptr~0.base, strtoul_~nptr~0.offset;strtoul_~ptr.base, strtoul_~ptr.offset := strtoul_#in~ptr.base, strtoul_#in~ptr.offset;strtoul_~endptr.base, strtoul_~endptr.offset := strtoul_#in~endptr.base, strtoul_#in~endptr.offset;strtoul_~base := strtoul_#in~base;strtoul_~neg~0 := 0;strtoul_~v~0 := 0;havoc strtoul_~orig~0.base, strtoul_~orig~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~ptr.base, strtoul_~ptr.offset; 351#L512-4 [2018-11-18 16:21:07,977 INFO L796 eck$LassoCheckResult]: Loop: 351#L512-4 assume true; 356#L512-1 call strtoul_#t~mem2 := read~int(strtoul_~nptr~0.base, strtoul_~nptr~0.offset, 1); 349#L512-2 assume !!(32 == strtoul_#t~mem2);havoc strtoul_#t~mem2;strtoul_#t~pre3.base, strtoul_#t~pre3.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset; 351#L512-4 [2018-11-18 16:21:07,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:07,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1239123438, now seen corresponding path program 1 times [2018-11-18 16:21:07,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:07,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:07,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:07,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:07,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:07,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:07,999 INFO L82 PathProgramCache]: Analyzing trace with hash 62629, now seen corresponding path program 1 times [2018-11-18 16:21:07,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:08,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:08,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:08,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:08,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:08,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:08,006 INFO L82 PathProgramCache]: Analyzing trace with hash -517534824, now seen corresponding path program 1 times [2018-11-18 16:21:08,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:08,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:08,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:08,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:08,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:08,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:21:08,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:21:08,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 16:21:08,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:21:08,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:21:08,099 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-11-18 16:21:08,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:21:08,197 INFO L93 Difference]: Finished difference Result 84 states and 119 transitions. [2018-11-18 16:21:08,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:21:08,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 119 transitions. [2018-11-18 16:21:08,199 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 23 [2018-11-18 16:21:08,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 119 transitions. [2018-11-18 16:21:08,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2018-11-18 16:21:08,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2018-11-18 16:21:08,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 119 transitions. [2018-11-18 16:21:08,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 16:21:08,201 INFO L705 BuchiCegarLoop]: Abstraction has 84 states and 119 transitions. [2018-11-18 16:21:08,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 119 transitions. [2018-11-18 16:21:08,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 43. [2018-11-18 16:21:08,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 16:21:08,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2018-11-18 16:21:08,205 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2018-11-18 16:21:08,205 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 58 transitions. [2018-11-18 16:21:08,205 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 16:21:08,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 58 transitions. [2018-11-18 16:21:08,206 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-18 16:21:08,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 16:21:08,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 16:21:08,206 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:21:08,206 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 16:21:08,207 INFO L794 eck$LassoCheckResult]: Stem: 509#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 479#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet29, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~nondet31, main_#t~ret32, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~base~0, main_~#end~0.base, main_~#end~0.offset;main_~in_len~0 := main_#t~nondet29;havoc main_#t~nondet29; 480#L562 assume !(main_~in_len~0 < 1);call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~base~0 := main_#t~nondet31;havoc main_#t~nondet31;call main_~#end~0.base, main_~#end~0.offset := #Ultimate.alloc(8);call write~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8);call write~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8);assume { :begin_inline_strtol } true;strtol_#in~nptr.base, strtol_#in~nptr.offset, strtol_#in~endptr.base, strtol_#in~endptr.offset, strtol_#in~base := main_~in~0.base, main_~in~0.offset, main_~#end~0.base, main_~#end~0.offset, main_~base~0;havoc strtol_#res;havoc strtol_#t~post22.base, strtol_#t~post22.offset, strtol_#t~mem21, strtol_#t~mem23, strtol_#t~pre24.base, strtol_#t~pre24.offset, strtol_#t~ret25, strtol_#t~mem26.base, strtol_#t~mem26.offset, strtol_#t~short27, strtol_#t~ite28, strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base, strtol_~neg~1, strtol_~v~1, strtol_~orig~1.base, strtol_~orig~1.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#in~nptr.base, strtol_#in~nptr.offset;strtol_~endptr.base, strtol_~endptr.offset := strtol_#in~endptr.base, strtol_#in~endptr.offset;strtol_~base := strtol_#in~base;strtol_~neg~1 := 0;havoc strtol_~v~1;strtol_~orig~1.base, strtol_~orig~1.offset := strtol_~nptr.base, strtol_~nptr.offset; 495#L554-4 assume true; 483#L554-1 call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 484#L554-2 assume !(32 == strtol_#t~mem21);havoc strtol_#t~mem21; 490#L554-5 call strtol_#t~mem23 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 496#L555 assume 45 == strtol_#t~mem23;havoc strtol_#t~mem23;strtol_~neg~1 := -1;strtol_#t~pre24.base, strtol_#t~pre24.offset := strtol_~nptr.base, 1 + strtol_~nptr.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_~nptr.base, 1 + strtol_~nptr.offset;havoc strtol_#t~pre24.base, strtol_#t~pre24.offset; 504#L555-2 assume { :begin_inline_strtoul } true;strtoul_#in~ptr.base, strtoul_#in~ptr.offset, strtoul_#in~endptr.base, strtoul_#in~endptr.offset, strtoul_#in~base := strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base;havoc strtoul_#res;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset, strtoul_#t~mem2, strtoul_#t~mem4, strtoul_#t~post5.base, strtoul_#t~post5.offset, strtoul_#t~mem6, strtoul_#t~pre7.base, strtoul_#t~pre7.offset, strtoul_#t~mem8, strtoul_#t~short9, strtoul_~b~0, strtoul_#t~mem10, strtoul_#t~mem11, strtoul_#t~mem12, strtoul_#t~short13, strtoul_#t~mem14, strtoul_#t~ite17, strtoul_#t~ite16, strtoul_#t~ite15, strtoul_~x~0, strtoul_~w~0, strtoul_#t~pre18.base, strtoul_#t~pre18.offset, strtoul_~c~0, strtoul_#t~mem19, strtoul_#t~ite20, strtoul_~ptr.base, strtoul_~ptr.offset, strtoul_~endptr.base, strtoul_~endptr.offset, strtoul_~base, strtoul_~neg~0, strtoul_~v~0, strtoul_~orig~0.base, strtoul_~orig~0.offset, strtoul_~nptr~0.base, strtoul_~nptr~0.offset;strtoul_~ptr.base, strtoul_~ptr.offset := strtoul_#in~ptr.base, strtoul_#in~ptr.offset;strtoul_~endptr.base, strtoul_~endptr.offset := strtoul_#in~endptr.base, strtoul_#in~endptr.offset;strtoul_~base := strtoul_#in~base;strtoul_~neg~0 := 0;strtoul_~v~0 := 0;havoc strtoul_~orig~0.base, strtoul_~orig~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~ptr.base, strtoul_~ptr.offset; 505#L512-4 [2018-11-18 16:21:08,207 INFO L796 eck$LassoCheckResult]: Loop: 505#L512-4 assume true; 502#L512-1 call strtoul_#t~mem2 := read~int(strtoul_~nptr~0.base, strtoul_~nptr~0.offset, 1); 503#L512-2 assume !!(32 == strtoul_#t~mem2);havoc strtoul_#t~mem2;strtoul_#t~pre3.base, strtoul_#t~pre3.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset; 505#L512-4 [2018-11-18 16:21:08,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:08,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1239123376, now seen corresponding path program 1 times [2018-11-18 16:21:08,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:08,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:08,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:08,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:08,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:08,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:08,226 INFO L82 PathProgramCache]: Analyzing trace with hash 62629, now seen corresponding path program 2 times [2018-11-18 16:21:08,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:08,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:08,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:08,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:21:08,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:08,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:08,230 INFO L82 PathProgramCache]: Analyzing trace with hash -519381866, now seen corresponding path program 1 times [2018-11-18 16:21:08,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:21:08,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:21:08,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:08,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 16:21:08,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:21:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:21:08,620 WARN L180 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 137 [2018-11-18 16:21:08,751 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-11-18 16:21:08,753 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 16:21:08,753 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 16:21:08,753 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 16:21:08,753 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 16:21:08,753 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 16:21:08,753 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 16:21:08,753 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 16:21:08,753 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 16:21:08,754 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtol_true-termination.c.i_Iteration3_Lasso [2018-11-18 16:21:08,754 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 16:21:08,754 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 16:21:08,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:08,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,006 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2018-11-18 16:21:09,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 16:21:09,440 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 16:21:09,440 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 16:21:09,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,451 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:09,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:09,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:09,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:09,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:09,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:09,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 16:21:09,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 16:21:09,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 16:21:09,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:09,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:09,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:09,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:09,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:09,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:09,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:09,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:09,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 16:21:09,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 16:21:09,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 16:21:09,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 16:21:09,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 16:21:09,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 16:21:09,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 16:21:09,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 16:21:09,531 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 16:21:09,543 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 16:21:09,543 INFO L444 ModelExtractionUtils]: 35 out of 40 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 16:21:09,544 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 16:21:09,544 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 16:21:09,545 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 16:21:09,545 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strtoul_~nptr~0.offset, v_rep(select #length ULTIMATE.start_main_~in~0.base)_1) = -1*ULTIMATE.start_strtoul_~nptr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~in~0.base)_1 Supporting invariants [] [2018-11-18 16:21:09,597 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2018-11-18 16:21:09,599 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-18 16:21:09,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:21:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:09,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:21:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:21:09,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:21:09,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:21:09,669 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-11-18 16:21:09,669 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 58 transitions. cyclomatic complexity: 18 Second operand 5 states. [2018-11-18 16:21:09,758 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 58 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 87 states and 120 transitions. Complement of second has 7 states. [2018-11-18 16:21:09,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 16:21:09,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 16:21:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2018-11-18 16:21:09,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-18 16:21:09,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:09,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-18 16:21:09,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:09,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-18 16:21:09,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 16:21:09,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 120 transitions. [2018-11-18 16:21:09,761 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:21:09,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 0 states and 0 transitions. [2018-11-18 16:21:09,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 16:21:09,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 16:21:09,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 16:21:09,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 16:21:09,762 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:21:09,762 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:21:09,762 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:21:09,762 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 16:21:09,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:21:09,762 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 16:21:09,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 16:21:09,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 04:21:09 BoogieIcfgContainer [2018-11-18 16:21:09,767 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 16:21:09,767 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:21:09,767 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:21:09,768 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:21:09,768 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:21:06" (3/4) ... [2018-11-18 16:21:09,771 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 16:21:09,771 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:21:09,771 INFO L168 Benchmark]: Toolchain (without parser) took 4197.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 956.6 MB in the beginning and 882.5 MB in the end (delta: 74.1 MB). Peak memory consumption was 238.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:09,772 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:21:09,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -137.4 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:09,773 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.97 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. [2018-11-18 16:21:09,773 INFO L168 Benchmark]: Boogie Preprocessor took 28.44 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:09,773 INFO L168 Benchmark]: RCFGBuilder took 436.86 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: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:09,774 INFO L168 Benchmark]: BuchiAutomizer took 3321.84 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 882.5 MB in the end (delta: 176.2 MB). Peak memory consumption was 232.8 MB. Max. memory is 11.5 GB. [2018-11-18 16:21:09,774 INFO L168 Benchmark]: Witness Printer took 3.32 ms. Allocated memory is still 1.2 GB. Free memory is still 882.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:21:09,776 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 360.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -137.4 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.97 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. * Boogie Preprocessor took 28.44 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 436.86 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: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3321.84 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 882.5 MB in the end (delta: 176.2 MB). Peak memory consumption was 232.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.32 ms. Allocated memory is still 1.2 GB. Free memory is still 882.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * nptr + unknown-#length-unknown[__builtin_alloca (in_len)] and consists of 5 locations. One deterministic module has affine ranking function -1 * nptr + unknown-#length-unknown[in] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 68 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 43 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 131 SDtfs, 295 SDslu, 275 SDs, 0 SdLazy, 202 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital208 mio100 ax100 hnf100 lsp89 ukn79 mio100 lsp37 div100 bol100 ite100 ukn100 eq190 hnf88 smp97 dnf107 smp100 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...