./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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b3d02d87-e592-4f12-8801-577dda1880d9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b3d02d87-e592-4f12-8801-577dda1880d9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b3d02d87-e592-4f12-8801-577dda1880d9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b3d02d87-e592-4f12-8801-577dda1880d9/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_b3d02d87-e592-4f12-8801-577dda1880d9/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b3d02d87-e592-4f12-8801-577dda1880d9/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-1dbac8b [2018-11-10 11:04:26,038 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:04:26,040 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:04:26,049 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:04:26,049 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:04:26,050 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:04:26,050 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:04:26,052 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:04:26,053 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:04:26,054 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:04:26,055 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:04:26,055 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:04:26,056 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:04:26,056 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:04:26,057 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:04:26,058 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:04:26,058 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:04:26,060 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:04:26,061 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:04:26,063 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:04:26,064 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:04:26,065 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:04:26,066 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:04:26,067 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:04:26,067 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:04:26,068 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:04:26,069 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:04:26,069 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:04:26,070 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:04:26,071 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:04:26,071 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:04:26,072 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:04:26,072 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:04:26,072 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:04:26,072 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:04:26,073 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:04:26,073 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b3d02d87-e592-4f12-8801-577dda1880d9/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 11:04:26,085 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:04:26,086 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:04:26,086 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:04:26,087 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:04:26,087 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:04:26,087 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:04:26,087 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:04:26,087 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:04:26,088 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:04:26,088 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:04:26,088 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:04:26,088 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:04:26,088 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:04:26,088 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:04:26,088 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:04:26,088 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:04:26,089 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:04:26,089 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:04:26,089 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:04:26,089 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:04:26,093 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:04:26,094 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:04:26,094 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:04:26,094 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:04:26,094 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:04:26,094 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:04:26,094 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:04:26,095 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:04:26,095 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_b3d02d87-e592-4f12-8801-577dda1880d9/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-10 11:04:26,120 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:04:26,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:04:26,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:04:26,135 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:04:26,135 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:04:26,136 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b3d02d87-e592-4f12-8801-577dda1880d9/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strtol_true-termination.c.i [2018-11-10 11:04:26,184 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3d02d87-e592-4f12-8801-577dda1880d9/bin-2019/uautomizer/data/d90cbe2a1/b46e525d0be64850beb7f06bf0d44738/FLAGbaa98cc7e [2018-11-10 11:04:26,586 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:04:26,586 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b3d02d87-e592-4f12-8801-577dda1880d9/sv-benchmarks/c/termination-libowfat/strtol_true-termination.c.i [2018-11-10 11:04:26,593 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b3d02d87-e592-4f12-8801-577dda1880d9/bin-2019/uautomizer/data/d90cbe2a1/b46e525d0be64850beb7f06bf0d44738/FLAGbaa98cc7e [2018-11-10 11:04:26,605 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b3d02d87-e592-4f12-8801-577dda1880d9/bin-2019/uautomizer/data/d90cbe2a1/b46e525d0be64850beb7f06bf0d44738 [2018-11-10 11:04:26,608 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:04:26,610 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:04:26,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:04:26,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:04:26,614 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:04:26,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:04:26" (1/1) ... [2018-11-10 11:04:26,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e7cccc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:26, skipping insertion in model container [2018-11-10 11:04:26,618 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:04:26" (1/1) ... [2018-11-10 11:04:26,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:04:26,664 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:04:26,917 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:04:26,924 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:04:26,964 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:04:26,998 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:04:26,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:26 WrapperNode [2018-11-10 11:04:26,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:04:27,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:04:27,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:04:27,000 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:04:27,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:26" (1/1) ... [2018-11-10 11:04:27,066 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:26" (1/1) ... [2018-11-10 11:04:27,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:04:27,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:04:27,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:04:27,087 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:04:27,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:26" (1/1) ... [2018-11-10 11:04:27,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:26" (1/1) ... [2018-11-10 11:04:27,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:26" (1/1) ... [2018-11-10 11:04:27,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:26" (1/1) ... [2018-11-10 11:04:27,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:26" (1/1) ... [2018-11-10 11:04:27,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:26" (1/1) ... [2018-11-10 11:04:27,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:26" (1/1) ... [2018-11-10 11:04:27,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:04:27,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:04:27,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:04:27,110 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:04:27,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b3d02d87-e592-4f12-8801-577dda1880d9/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-10 11:04:27,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 11:04:27,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 11:04:27,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-10 11:04:27,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-10 11:04:27,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:04:27,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:04:27,503 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:04:27,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:04:27 BoogieIcfgContainer [2018-11-10 11:04:27,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:04:27,504 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:04:27,504 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:04:27,506 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:04:27,507 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:04:27,507 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:04:26" (1/3) ... [2018-11-10 11:04:27,508 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25bedd8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:04:27, skipping insertion in model container [2018-11-10 11:04:27,508 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:04:27,508 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:04:26" (2/3) ... [2018-11-10 11:04:27,508 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25bedd8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:04:27, skipping insertion in model container [2018-11-10 11:04:27,508 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:04:27,508 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:04:27" (3/3) ... [2018-11-10 11:04:27,510 INFO L375 chiAutomizerObserver]: Analyzing ICFG strtol_true-termination.c.i [2018-11-10 11:04:27,560 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:04:27,560 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:04:27,561 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:04:27,561 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:04:27,561 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:04:27,561 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:04:27,561 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:04:27,561 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:04:27,561 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:04:27,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states. [2018-11-10 11:04:27,594 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-10 11:04:27,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:04:27,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:04:27,599 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:04:27,599 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 11:04:27,600 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:04:27,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states. [2018-11-10 11:04:27,603 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-10 11:04:27,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:04:27,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:04:27,604 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:04:27,604 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 11:04:27,611 INFO L793 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#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; 64#L562true assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset; 22#L564true SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L564 26#L564-1true main_~base~0 := main_#t~nondet31;havoc main_#t~nondet31;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#end~0.base, main_~#end~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 3#L566true SUMMARY for call write~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8); srcloc: L566 5#L566-1true 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; 50#L554-4true [2018-11-10 11:04:27,612 INFO L795 eck$LassoCheckResult]: Loop: 50#L554-4true assume true; 45#L554-1true SUMMARY for call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); srcloc: L554-1 48#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, strtol_#t~post22.offset + 1;havoc strtol_#t~post22.base, strtol_#t~post22.offset; 50#L554-4true [2018-11-10 11:04:27,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:04:27,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1806780582, now seen corresponding path program 1 times [2018-11-10 11:04:27,619 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:04:27,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:04:27,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:04:27,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:04:27,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:04:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:04:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:04:27,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:04:27,733 INFO L82 PathProgramCache]: Analyzing trace with hash 44755, now seen corresponding path program 1 times [2018-11-10 11:04:27,733 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:04:27,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:04:27,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:04:27,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:04:27,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:04:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:04:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:04:27,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:04:27,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1270179854, now seen corresponding path program 1 times [2018-11-10 11:04:27,744 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:04:27,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:04:27,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:04:27,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:04:27,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:04:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:04:27,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:04:28,184 WARN L179 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 115 [2018-11-10 11:04:28,304 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-11-10 11:04:28,313 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:04:28,314 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:04:28,314 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:04:28,314 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:04:28,315 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:04:28,315 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:04:28,315 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:04:28,315 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:04:28,315 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtol_true-termination.c.i_Iteration1_Lasso [2018-11-10 11:04:28,315 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:04:28,316 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:04:28,336 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-10 11:04:28,340 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-10 11:04:28,343 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-10 11:04:28,345 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-10 11:04:28,350 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-10 11:04:28,353 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-10 11:04:28,355 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-10 11:04:28,358 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-10 11:04:28,360 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-10 11:04:28,362 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-10 11:04:28,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:04:28,366 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-10 11:04:28,546 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2018-11-10 11:04:28,598 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-10 11:04:28,599 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-10 11:04:28,605 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-10 11:04:28,607 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-10 11:04:28,608 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-10 11:04:28,612 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-10 11:04:28,614 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-10 11:04:28,616 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-10 11:04:28,618 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-10 11:04:28,620 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-10 11:04:28,973 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:04:28,977 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:04:28,978 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-10 11:04:28,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:28,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:28,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:28,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:28,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:28,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:28,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:28,986 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:28,986 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-10 11:04:28,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:28,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:28,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:28,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:28,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:28,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:28,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:28,989 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:28,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:04:28,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:28,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:28,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:28,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:28,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:28,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:28,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:28,992 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:28,992 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-10 11:04:28,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:28,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:28,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:28,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:28,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:28,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:28,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:28,995 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:28,995 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-10 11:04:28,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:28,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:28,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:28,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:28,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:04:28,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:04:29,001 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:29,002 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-10 11:04:29,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:29,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:29,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:29,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:29,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:29,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:29,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:29,003 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:29,004 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-10 11:04:29,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:29,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:29,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:29,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:29,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:29,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:29,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:29,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:29,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:04:29,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:29,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:29,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:29,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:29,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:29,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:29,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:29,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:29,009 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-10 11:04:29,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:29,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:29,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:29,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:29,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:29,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:29,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:29,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:29,012 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-10 11:04:29,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:29,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:29,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:29,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:29,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:04:29,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:04:29,018 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:29,018 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-10 11:04:29,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:29,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:29,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:29,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:29,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:29,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:29,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:29,021 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:29,021 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-10 11:04:29,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:29,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:29,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:29,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:29,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:04:29,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:04:29,027 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:29,027 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-10 11:04:29,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:29,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:29,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:29,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:29,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:04:29,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:04:29,094 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:04:29,122 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 11:04:29,123 INFO L444 ModelExtractionUtils]: 25 out of 34 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-10 11:04:29,125 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:04:29,126 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:04:29,126 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:04:29,127 INFO L519 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-10 11:04:29,167 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-11-10 11:04:29,174 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 11:04:29,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:04:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:04:29,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:04:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:04:29,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:04:29,268 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-10 11:04:29,281 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-10 11:04:29,281 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states. Second operand 5 states. [2018-11-10 11:04:29,445 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states.. Second operand 5 states. Result 273 states and 388 transitions. Complement of second has 9 states. [2018-11-10 11:04:29,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 11:04:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 11:04:29,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 237 transitions. [2018-11-10 11:04:29,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 237 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-10 11:04:29,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:04:29,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 237 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-10 11:04:29,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:04:29,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 237 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-10 11:04:29,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:04:29,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 273 states and 388 transitions. [2018-11-10 11:04:29,458 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-11-10 11:04:29,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 273 states to 88 states and 115 transitions. [2018-11-10 11:04:29,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2018-11-10 11:04:29,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-11-10 11:04:29,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 115 transitions. [2018-11-10 11:04:29,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:04:29,465 INFO L705 BuchiCegarLoop]: Abstraction has 88 states and 115 transitions. [2018-11-10 11:04:29,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 115 transitions. [2018-11-10 11:04:29,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 52. [2018-11-10 11:04:29,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 11:04:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2018-11-10 11:04:29,487 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 67 transitions. [2018-11-10 11:04:29,487 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 67 transitions. [2018-11-10 11:04:29,487 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:04:29,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 67 transitions. [2018-11-10 11:04:29,488 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-10 11:04:29,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:04:29,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:04:29,489 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:04:29,489 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 11:04:29,489 INFO L793 eck$LassoCheckResult]: Stem: 478#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 446#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; 447#L562 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset; 475#L564 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L564 476#L564-1 main_~base~0 := main_#t~nondet31;havoc main_#t~nondet31;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#end~0.base, main_~#end~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 436#L566 SUMMARY for call write~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8); srcloc: L566 437#L566-1 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; 445#L554-4 assume true; 452#L554-1 SUMMARY for call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); srcloc: L554-1 453#L554-2 assume !(32 == strtol_#t~mem21);havoc strtol_#t~mem21; 461#L554-5 SUMMARY for call strtol_#t~mem23 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); srcloc: L554-5 440#L555 assume !(strtol_#t~mem23 == 45);havoc strtol_#t~mem23; 441#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; 458#L512-4 [2018-11-10 11:04:29,489 INFO L795 eck$LassoCheckResult]: Loop: 458#L512-4 assume true; 465#L512-1 SUMMARY for call strtoul_#t~mem2 := read~int(strtoul_~nptr~0.base, strtoul_~nptr~0.offset, 1); srcloc: L512-1 456#L512-2 assume !!(strtoul_#t~mem2 == 32);havoc strtoul_#t~mem2;strtoul_#t~pre3.base, strtoul_#t~pre3.offset := strtoul_~nptr~0.base, strtoul_~nptr~0.offset + 1;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~nptr~0.base, strtoul_~nptr~0.offset + 1;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset; 458#L512-4 [2018-11-10 11:04:29,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:04:29,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1266119152, now seen corresponding path program 1 times [2018-11-10 11:04:29,490 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:04:29,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:04:29,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:04:29,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:04:29,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:04:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:04:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:04:29,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:04:29,519 INFO L82 PathProgramCache]: Analyzing trace with hash 66601, now seen corresponding path program 1 times [2018-11-10 11:04:29,519 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:04:29,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:04:29,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:04:29,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:04:29,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:04:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:04:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:04:29,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:04:29,526 INFO L82 PathProgramCache]: Analyzing trace with hash 552900570, now seen corresponding path program 1 times [2018-11-10 11:04:29,526 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:04:29,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:04:29,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:04:29,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:04:29,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:04:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:04:29,609 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-10 11:04:29,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:04:29,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 11:04:29,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:04:29,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:04:29,633 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-11-10 11:04:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:04:29,759 INFO L93 Difference]: Finished difference Result 114 states and 149 transitions. [2018-11-10 11:04:29,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:04:29,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 149 transitions. [2018-11-10 11:04:29,762 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 27 [2018-11-10 11:04:29,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 114 states and 149 transitions. [2018-11-10 11:04:29,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2018-11-10 11:04:29,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2018-11-10 11:04:29,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 149 transitions. [2018-11-10 11:04:29,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 11:04:29,764 INFO L705 BuchiCegarLoop]: Abstraction has 114 states and 149 transitions. [2018-11-10 11:04:29,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 149 transitions. [2018-11-10 11:04:29,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 56. [2018-11-10 11:04:29,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-10 11:04:29,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2018-11-10 11:04:29,768 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2018-11-10 11:04:29,768 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2018-11-10 11:04:29,768 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 11:04:29,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 71 transitions. [2018-11-10 11:04:29,769 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-10 11:04:29,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:04:29,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:04:29,770 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:04:29,770 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-10 11:04:29,770 INFO L793 eck$LassoCheckResult]: Stem: 665#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 629#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; 630#L562 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~in~0.base, main_~in~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset; 657#L564 SUMMARY for call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L564 658#L564-1 main_~base~0 := main_#t~nondet31;havoc main_#t~nondet31;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 8;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#end~0.base, main_~#end~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true; 617#L566 SUMMARY for call write~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8); srcloc: L566 618#L566-1 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; 626#L554-4 assume true; 635#L554-1 SUMMARY for call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); srcloc: L554-1 636#L554-2 assume !(32 == strtol_#t~mem21);havoc strtol_#t~mem21; 642#L554-5 SUMMARY for call strtol_#t~mem23 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); srcloc: L554-5 621#L555 assume strtol_#t~mem23 == 45;havoc strtol_#t~mem23;strtol_~neg~1 := -1;strtol_#t~pre24.base, strtol_#t~pre24.offset := strtol_~nptr.base, strtol_~nptr.offset + 1;strtol_~nptr.base, strtol_~nptr.offset := strtol_~nptr.base, strtol_~nptr.offset + 1;havoc strtol_#t~pre24.base, strtol_#t~pre24.offset; 622#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; 645#L512-4 [2018-11-10 11:04:29,770 INFO L795 eck$LassoCheckResult]: Loop: 645#L512-4 assume true; 646#L512-1 SUMMARY for call strtoul_#t~mem2 := read~int(strtoul_~nptr~0.base, strtoul_~nptr~0.offset, 1); srcloc: L512-1 667#L512-2 assume !!(strtoul_#t~mem2 == 32);havoc strtoul_#t~mem2;strtoul_#t~pre3.base, strtoul_#t~pre3.offset := strtoul_~nptr~0.base, strtoul_~nptr~0.offset + 1;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~nptr~0.base, strtoul_~nptr~0.offset + 1;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset; 645#L512-4 [2018-11-10 11:04:29,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:04:29,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1266119090, now seen corresponding path program 1 times [2018-11-10 11:04:29,771 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:04:29,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:04:29,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:04:29,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:04:29,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:04:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:04:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:04:29,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:04:29,797 INFO L82 PathProgramCache]: Analyzing trace with hash 66601, now seen corresponding path program 2 times [2018-11-10 11:04:29,797 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:04:29,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:04:29,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:04:29,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:04:29,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:04:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:04:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:04:29,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:04:29,803 INFO L82 PathProgramCache]: Analyzing trace with hash 551053528, now seen corresponding path program 1 times [2018-11-10 11:04:29,803 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:04:29,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:04:29,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:04:29,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:04:29,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:04:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:04:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:04:30,350 WARN L179 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 158 [2018-11-10 11:04:30,491 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2018-11-10 11:04:30,493 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:04:30,493 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:04:30,493 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:04:30,493 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:04:30,493 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:04:30,493 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:04:30,493 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:04:30,493 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:04:30,493 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtol_true-termination.c.i_Iteration3_Lasso [2018-11-10 11:04:30,493 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:04:30,493 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:04:30,499 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-10 11:04:30,501 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-10 11:04:30,502 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-10 11:04:30,503 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-10 11:04:30,504 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-10 11:04:30,509 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-10 11:04:30,510 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-10 11:04:30,511 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-10 11:04:30,512 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-10 11:04:30,513 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-10 11:04:30,522 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-10 11:04:30,524 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-10 11:04:30,525 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-10 11:04:30,526 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-10 11:04:30,527 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-10 11:04:30,528 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-10 11:04:30,530 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-10 11:04:30,531 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-10 11:04:30,532 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-10 11:04:30,538 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-10 11:04:30,539 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-10 11:04:30,541 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-10 11:04:30,542 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-10 11:04:30,543 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-10 11:04:30,544 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-10 11:04:30,545 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-10 11:04:30,546 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-10 11:04:30,548 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-10 11:04:30,549 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-10 11:04:30,550 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-10 11:04:30,552 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-10 11:04:30,552 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-10 11:04:30,553 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-10 11:04:30,554 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-10 11:04:30,804 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 106 [2018-11-10 11:04:30,864 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-10 11:04:30,865 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-10 11:04:30,867 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-10 11:04:30,868 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-10 11:04:30,869 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-10 11:04:30,870 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-10 11:04:30,871 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-10 11:04:30,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:04:30,876 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-10 11:04:30,877 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-10 11:04:30,878 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-10 11:04:30,879 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-10 11:04:30,880 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-10 11:04:30,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:04:30,883 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-10 11:04:30,884 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-10 11:04:30,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:04:30,887 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-10 11:04:30,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:04:30,889 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-10 11:04:31,354 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:04:31,354 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:04:31,355 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-10 11:04:31,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,357 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,357 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-10 11:04:31,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,359 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,359 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-10 11:04:31,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,361 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,361 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-10 11:04:31,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,362 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,363 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-10 11:04:31,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,363 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:04:31,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:04:31,368 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,368 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-10 11:04:31,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,370 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,370 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-10 11:04:31,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,372 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,372 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-10 11:04:31,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:04:31,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:04:31,376 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,376 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-10 11:04:31,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,378 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,378 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-10 11:04:31,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,380 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,380 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-10 11:04:31,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:04:31,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:04:31,383 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,384 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-10 11:04:31,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,386 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-10 11:04:31,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,387 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,388 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-10 11:04:31,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,389 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,390 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-10 11:04:31,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,391 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,392 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-10 11:04:31,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,394 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,394 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-10 11:04:31,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,396 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,396 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-10 11:04:31,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,397 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:04:31,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,399 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,400 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-10 11:04:31,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,401 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,402 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-10 11:04:31,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,403 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,404 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-10 11:04:31,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,405 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:04:31,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,407 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,408 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-10 11:04:31,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,409 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,410 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-10 11:04:31,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,411 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,412 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-10 11:04:31,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,413 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,413 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,414 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-10 11:04:31,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,415 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,416 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-10 11:04:31,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,417 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,418 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-10 11:04:31,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:04:31,419 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:04:31,420 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,421 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-10 11:04:31,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,423 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,423 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-10 11:04:31,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,424 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,425 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-10 11:04:31,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,426 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,426 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-10 11:04:31,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,428 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-10 11:04:31,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:04:31,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:04:31,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:04:31,431 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,431 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-10 11:04:31,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:04:31,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:04:31,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,435 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-10 11:04:31,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:04:31,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:04:31,438 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,438 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-10 11:04:31,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,439 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:04:31,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,441 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:04:31,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:04:31,452 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,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-10 11:04:31,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:04:31,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:04:31,458 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:04:31,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:04:31,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:04:31,461 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:04:31,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:04:31,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:04:31,470 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,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-10 11:04:31,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:04:31,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:04:31,474 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,474 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-10 11:04:31,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:04:31,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:04:31,477 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,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-10 11:04:31,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:04:31,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:04:31,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,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-10 11:04:31,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,482 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 11:04:31,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,484 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 11:04:31,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:04:31,489 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:04:31,489 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-10 11:04:31,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:04:31,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:04:31,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:04:31,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:04:31,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:04:31,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:04:31,525 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 11:04:31,548 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-10 11:04:31,548 INFO L444 ModelExtractionUtils]: 42 out of 49 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 11:04:31,548 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 11:04:31,549 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 11:04:31,549 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 11:04:31,550 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc30.base)_2, ULTIMATE.start_strtoul_~nptr~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc30.base)_2 - 1*ULTIMATE.start_strtoul_~nptr~0.offset Supporting invariants [] [2018-11-10 11:04:31,589 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2018-11-10 11:04:31,591 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-10 11:04:31,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:04:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:04:31,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:04:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:04:31,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:04:31,665 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-10 11:04:31,666 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-10 11:04:31,666 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 71 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-11-10 11:04:31,761 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 71 transitions. cyclomatic complexity: 18. Second operand 6 states. Result 113 states and 146 transitions. Complement of second has 8 states. [2018-11-10 11:04:31,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 11:04:31,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-10 11:04:31,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2018-11-10 11:04:31,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 75 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-10 11:04:31,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:04:31,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 75 transitions. Stem has 16 letters. Loop has 3 letters. [2018-11-10 11:04:31,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:04:31,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 75 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-10 11:04:31,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 11:04:31,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 146 transitions. [2018-11-10 11:04:31,766 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:04:31,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 0 states and 0 transitions. [2018-11-10 11:04:31,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 11:04:31,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 11:04:31,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 11:04:31,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:04:31,766 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:04:31,766 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:04:31,767 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:04:31,767 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 11:04:31,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:04:31,767 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:04:31,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 11:04:31,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:04:31 BoogieIcfgContainer [2018-11-10 11:04:31,775 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:04:31,776 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:04:31,776 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:04:31,776 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:04:31,776 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:04:27" (3/4) ... [2018-11-10 11:04:31,780 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 11:04:31,780 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:04:31,780 INFO L168 Benchmark]: Toolchain (without parser) took 5171.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.8 MB). Free memory was 957.6 MB in the beginning and 1.0 GB in the end (delta: -68.6 MB). Peak memory consumption was 131.1 MB. Max. memory is 11.5 GB. [2018-11-10 11:04:31,781 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:04:31,782 INFO L168 Benchmark]: CACSL2BoogieTranslator took 388.76 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 930.6 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2018-11-10 11:04:31,782 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 930.6 MB in the beginning and 1.1 GB in the end (delta: -212.3 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-11-10 11:04:31,783 INFO L168 Benchmark]: Boogie Preprocessor took 23.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:04:31,783 INFO L168 Benchmark]: RCFGBuilder took 393.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.9 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. [2018-11-10 11:04:31,784 INFO L168 Benchmark]: BuchiAutomizer took 4271.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.7 MB). Peak memory consumption was 130.6 MB. Max. memory is 11.5 GB. [2018-11-10 11:04:31,784 INFO L168 Benchmark]: Witness Printer took 4.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:04:31,788 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 388.76 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 930.6 MB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 930.6 MB in the beginning and 1.1 GB in the end (delta: -212.3 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 393.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.9 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4271.76 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 50.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 79.7 MB). Peak memory consumption was 130.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.02 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #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 6 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (in_len)] + -1 * nptr and consists of 6 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.2s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.5s. Construction of modules took 0.2s. 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, 94 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 56 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 239 SDtfs, 338 SDslu, 445 SDs, 0 SdLazy, 254 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital213 mio100 ax100 hnf100 lsp89 ukn98 mio100 lsp36 div100 bol100 ite100 ukn100 eq204 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 8 VariablesLoop: 5 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...