./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strrchr_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ebcb67e1-10c6-439a-acef-a0e001230ccd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ebcb67e1-10c6-439a-acef-a0e001230ccd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ebcb67e1-10c6-439a-acef-a0e001230ccd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ebcb67e1-10c6-439a-acef-a0e001230ccd/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strrchr_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ebcb67e1-10c6-439a-acef-a0e001230ccd/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ebcb67e1-10c6-439a-acef-a0e001230ccd/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 900f92af74c0348435977f69b7ec984c63076a1b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 05:23:56,366 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:23:56,367 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:23:56,376 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:23:56,377 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:23:56,377 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:23:56,378 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:23:56,380 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:23:56,382 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:23:56,382 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:23:56,383 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:23:56,384 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:23:56,384 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:23:56,385 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:23:56,386 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:23:56,387 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:23:56,388 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:23:56,389 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:23:56,391 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:23:56,392 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:23:56,393 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:23:56,394 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:23:56,396 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:23:56,396 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:23:56,396 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:23:56,397 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:23:56,398 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:23:56,399 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:23:56,399 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:23:56,400 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:23:56,400 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:23:56,401 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:23:56,401 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:23:56,401 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:23:56,402 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:23:56,402 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:23:56,402 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ebcb67e1-10c6-439a-acef-a0e001230ccd/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 05:23:56,418 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:23:56,419 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:23:56,420 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:23:56,420 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:23:56,420 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 05:23:56,420 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 05:23:56,421 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 05:23:56,421 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 05:23:56,421 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 05:23:56,421 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 05:23:56,421 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 05:23:56,421 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:23:56,422 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 05:23:56,422 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:23:56,422 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:23:56,422 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 05:23:56,422 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 05:23:56,422 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 05:23:56,422 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:23:56,423 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 05:23:56,423 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:23:56,423 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 05:23:56,423 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:23:56,423 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:23:56,423 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 05:23:56,424 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:23:56,424 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 05:23:56,424 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 05:23:56,425 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 05:23:56,425 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_ebcb67e1-10c6-439a-acef-a0e001230ccd/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 -> 900f92af74c0348435977f69b7ec984c63076a1b [2018-11-23 05:23:56,450 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:23:56,460 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:23:56,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:23:56,464 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:23:56,464 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:23:56,465 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ebcb67e1-10c6-439a-acef-a0e001230ccd/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strrchr_true-termination.c.i [2018-11-23 05:23:56,514 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ebcb67e1-10c6-439a-acef-a0e001230ccd/bin-2019/uautomizer/data/9b79e5593/9e9fffe779d94ce089da35e5b8477878/FLAGf33798bea [2018-11-23 05:23:56,888 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:23:56,889 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ebcb67e1-10c6-439a-acef-a0e001230ccd/sv-benchmarks/c/termination-libowfat/strrchr_true-termination.c.i [2018-11-23 05:23:56,899 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ebcb67e1-10c6-439a-acef-a0e001230ccd/bin-2019/uautomizer/data/9b79e5593/9e9fffe779d94ce089da35e5b8477878/FLAGf33798bea [2018-11-23 05:23:56,909 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ebcb67e1-10c6-439a-acef-a0e001230ccd/bin-2019/uautomizer/data/9b79e5593/9e9fffe779d94ce089da35e5b8477878 [2018-11-23 05:23:56,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:23:56,912 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:23:56,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:23:56,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:23:56,915 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:23:56,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:23:56" (1/1) ... [2018-11-23 05:23:56,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25fa39dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:23:56, skipping insertion in model container [2018-11-23 05:23:56,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:23:56" (1/1) ... [2018-11-23 05:23:56,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:23:56,956 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:23:57,154 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:23:57,161 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:23:57,234 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:23:57,263 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:23:57,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:23:57 WrapperNode [2018-11-23 05:23:57,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:23:57,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:23:57,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:23:57,264 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:23:57,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:23:57" (1/1) ... [2018-11-23 05:23:57,280 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:23:57" (1/1) ... [2018-11-23 05:23:57,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:23:57,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:23:57,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:23:57,295 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:23:57,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:23:57" (1/1) ... [2018-11-23 05:23:57,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:23:57" (1/1) ... [2018-11-23 05:23:57,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:23:57" (1/1) ... [2018-11-23 05:23:57,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:23:57" (1/1) ... [2018-11-23 05:23:57,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:23:57" (1/1) ... [2018-11-23 05:23:57,310 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:23:57" (1/1) ... [2018-11-23 05:23:57,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:23:57" (1/1) ... [2018-11-23 05:23:57,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:23:57,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:23:57,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:23:57,313 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:23:57,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:23:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ebcb67e1-10c6-439a-acef-a0e001230ccd/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-23 05:23:57,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:23:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 05:23:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 05:23:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:23:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:23:57,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:23:57,520 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:23:57,520 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 05:23:57,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:23:57 BoogieIcfgContainer [2018-11-23 05:23:57,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:23:57,521 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 05:23:57,521 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 05:23:57,524 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 05:23:57,525 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:23:57,525 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 05:23:56" (1/3) ... [2018-11-23 05:23:57,527 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71391504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:23:57, skipping insertion in model container [2018-11-23 05:23:57,527 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:23:57,527 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:23:57" (2/3) ... [2018-11-23 05:23:57,527 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71391504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 05:23:57, skipping insertion in model container [2018-11-23 05:23:57,528 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 05:23:57,528 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:23:57" (3/3) ... [2018-11-23 05:23:57,529 INFO L375 chiAutomizerObserver]: Analyzing ICFG strrchr_true-termination.c.i [2018-11-23 05:23:57,564 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:23:57,565 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 05:23:57,565 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 05:23:57,565 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 05:23:57,565 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:23:57,565 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:23:57,565 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 05:23:57,565 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:23:57,565 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 05:23:57,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-23 05:23:57,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-23 05:23:57,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:23:57,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:23:57,595 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 05:23:57,595 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:23:57,595 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 05:23:57,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2018-11-23 05:23:57,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-23 05:23:57,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:23:57,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:23:57,597 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 05:23:57,597 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:23:57,602 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~ret17.base, main_#t~ret17.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~the_int~0;main_~in_len~0 := main_#t~nondet14;havoc main_#t~nondet14; 16#L520true assume !(main_~in_len~0 < 1);call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~the_int~0 := main_#t~nondet16;havoc main_#t~nondet16;strrchr_#in~t.base, strrchr_#in~t.offset, strrchr_#in~c := main_~in~0.base, main_~in~0.offset, main_~the_int~0;havoc strrchr_#res.base, strrchr_#res.offset;havoc strrchr_#t~mem2, strrchr_#t~mem3, strrchr_#t~pre4.base, strrchr_#t~pre4.offset, strrchr_#t~mem5, strrchr_#t~mem6, strrchr_#t~pre7.base, strrchr_#t~pre7.offset, strrchr_#t~mem8, strrchr_#t~mem9, strrchr_#t~pre10.base, strrchr_#t~pre10.offset, strrchr_#t~mem11, strrchr_#t~mem12, strrchr_#t~pre13.base, strrchr_#t~pre13.offset, strrchr_~t.base, strrchr_~t.offset, strrchr_~c, strrchr_~ch~0, strrchr_~l~0.base, strrchr_~l~0.offset;strrchr_~t.base, strrchr_~t.offset := strrchr_#in~t.base, strrchr_#in~t.offset;strrchr_~c := strrchr_#in~c;havoc strrchr_~ch~0;strrchr_~l~0.base, strrchr_~l~0.offset := 0, 0;strrchr_~ch~0 := (if strrchr_~c % 256 <= 127 then strrchr_~c % 256 else strrchr_~c % 256 - 256); 19#L510-2true [2018-11-23 05:23:57,603 INFO L796 eck$LassoCheckResult]: Loop: 19#L510-2true assume !false;call strrchr_#t~mem2 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 9#L511true assume strrchr_#t~mem2 == strrchr_~ch~0;havoc strrchr_#t~mem2;strrchr_~l~0.base, strrchr_~l~0.offset := strrchr_~t.base, strrchr_~t.offset; 17#L511-2true call strrchr_#t~mem3 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 21#L511-3true assume !(0 == strrchr_#t~mem3);havoc strrchr_#t~mem3;strrchr_#t~pre4.base, strrchr_#t~pre4.offset := strrchr_~t.base, 1 + strrchr_~t.offset;strrchr_~t.base, strrchr_~t.offset := strrchr_~t.base, 1 + strrchr_~t.offset;havoc strrchr_#t~pre4.base, strrchr_#t~pre4.offset;call strrchr_#t~mem5 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 7#L512true assume !(strrchr_#t~mem5 == strrchr_~ch~0);havoc strrchr_#t~mem5; 13#L512-2true call strrchr_#t~mem6 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 18#L512-3true assume !(0 == strrchr_#t~mem6);havoc strrchr_#t~mem6;strrchr_#t~pre7.base, strrchr_#t~pre7.offset := strrchr_~t.base, 1 + strrchr_~t.offset;strrchr_~t.base, strrchr_~t.offset := strrchr_~t.base, 1 + strrchr_~t.offset;havoc strrchr_#t~pre7.base, strrchr_#t~pre7.offset;call strrchr_#t~mem8 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 6#L513true assume strrchr_#t~mem8 == strrchr_~ch~0;havoc strrchr_#t~mem8;strrchr_~l~0.base, strrchr_~l~0.offset := strrchr_~t.base, strrchr_~t.offset; 10#L513-2true call strrchr_#t~mem9 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 14#L513-3true assume !(0 == strrchr_#t~mem9);havoc strrchr_#t~mem9;strrchr_#t~pre10.base, strrchr_#t~pre10.offset := strrchr_~t.base, 1 + strrchr_~t.offset;strrchr_~t.base, strrchr_~t.offset := strrchr_~t.base, 1 + strrchr_~t.offset;havoc strrchr_#t~pre10.base, strrchr_#t~pre10.offset;call strrchr_#t~mem11 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 4#L514true assume strrchr_#t~mem11 == strrchr_~ch~0;havoc strrchr_#t~mem11;strrchr_~l~0.base, strrchr_~l~0.offset := strrchr_~t.base, strrchr_~t.offset; 8#L514-2true call strrchr_#t~mem12 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 11#L514-3true assume !(0 == strrchr_#t~mem12);havoc strrchr_#t~mem12;strrchr_#t~pre13.base, strrchr_#t~pre13.offset := strrchr_~t.base, 1 + strrchr_~t.offset;strrchr_~t.base, strrchr_~t.offset := strrchr_~t.base, 1 + strrchr_~t.offset;havoc strrchr_#t~pre13.base, strrchr_#t~pre13.offset; 19#L510-2true [2018-11-23 05:23:57,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:23:57,607 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-23 05:23:57,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:23:57,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:23:57,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:23:57,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:23:57,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:23:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:23:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:23:57,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:23:57,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1555843192, now seen corresponding path program 1 times [2018-11-23 05:23:57,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:23:57,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:23:57,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:23:57,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:23:57,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:23:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:23:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:23:57,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:23:57,727 INFO L82 PathProgramCache]: Analyzing trace with hash -220781627, now seen corresponding path program 1 times [2018-11-23 05:23:57,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:23:57,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:23:57,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:23:57,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:23:57,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:23:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:23:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:23:58,019 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 79 [2018-11-23 05:23:58,276 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-11-23 05:23:58,284 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:23:58,284 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:23:58,285 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:23:58,285 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:23:58,285 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:23:58,285 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:23:58,285 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:23:58,285 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:23:58,286 INFO L131 ssoRankerPreferences]: Filename of dumped script: strrchr_true-termination.c.i_Iteration1_Lasso [2018-11-23 05:23:58,286 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:23:58,286 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:23:58,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:23:58,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:23:58,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:23:58,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:23:58,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:23:58,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:23:58,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:23:58,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:23:58,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-23 05:23:58,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:23:58,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:23:58,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-23 05:23:58,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:23:58,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-23 05:23:58,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-23 05:23:58,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:23:58,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-23 05:23:58,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-23 05:23:58,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-23 05:23:58,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:23:58,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-23 05:23:58,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:23:58,586 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2018-11-23 05:23:58,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:23:58,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:23:58,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:23:58,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:23:59,079 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-23 05:23:59,122 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:23:59,126 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:23:59,128 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-23 05:23:59,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:23:59,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:23:59,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,139 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-23 05:23:59,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:23:59,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:23:59,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:23:59,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,144 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-23 05:23:59,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:23:59,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:23:59,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:23:59,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,147 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-23 05:23:59,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:23:59,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:23:59,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:23:59,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,151 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-23 05:23:59,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:23:59,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:23:59,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:23:59,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,155 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-23 05:23:59,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:23:59,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:23:59,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:23:59,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,160 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-23 05:23:59,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:23:59,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:23:59,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:23:59,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,164 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-23 05:23:59,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:23:59,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:23:59,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:23:59,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,169 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-23 05:23:59,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:23:59,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:23:59,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:23:59,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,172 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-23 05:23:59,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:23:59,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:23:59,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:23:59,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,174 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-23 05:23:59,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:23:59,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:23:59,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:23:59,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,181 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-23 05:23:59,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:23:59,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:23:59,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:23:59,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,183 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-23 05:23:59,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:23:59,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:23:59,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,193 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-23 05:23:59,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:23:59,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:23:59,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:23:59,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,195 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-23 05:23:59,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:23:59,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:23:59,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:23:59,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,201 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-23 05:23:59,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:23:59,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:23:59,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:23:59,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,203 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-23 05:23:59,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:23:59,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:23:59,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:23:59,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,206 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-23 05:23:59,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:23:59,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:23:59,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:23:59,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,208 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-23 05:23:59,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:23:59,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:23:59,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:23:59,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,210 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-23 05:23:59,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:23:59,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:23:59,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:23:59,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,212 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-23 05:23:59,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:23:59,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:23:59,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:23:59,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,214 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-23 05:23:59,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,215 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:23:59,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,218 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:23:59,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:23:59,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,235 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-23 05:23:59,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,237 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:23:59,237 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:23:59,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,245 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-23 05:23:59,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,247 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:23:59,247 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-23 05:23:59,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,297 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-11-23 05:23:59,297 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-23 05:23:59,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:23:59,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:23:59,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:23:59,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:23:59,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:23:59,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:23:59,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:23:59,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:23:59,487 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:23:59,515 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 05:23:59,516 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 05:23:59,518 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:23:59,519 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2018-11-23 05:23:59,519 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:23:59,521 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc15.base)_1, ULTIMATE.start_strrchr_~l~0.offset) = 5*v_rep(select #length ULTIMATE.start_main_#t~malloc15.base)_1 - 4*ULTIMATE.start_strrchr_~l~0.offset Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_#t~malloc15.base)_1 - 1*ULTIMATE.start_strrchr_~l~0.offset >= 0, 1*ULTIMATE.start_strrchr_~t.offset - 1*ULTIMATE.start_strrchr_~l~0.offset >= 0] [2018-11-23 05:23:59,570 INFO L297 tatePredicateManager]: 10 out of 12 supporting invariants were superfluous and have been removed [2018-11-23 05:23:59,580 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 05:23:59,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:23:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:23:59,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:23:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:23:59,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:23:59,828 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-23 05:23:59,838 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-23 05:23:59,839 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 7 states. [2018-11-23 05:24:00,268 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 7 states. Result 108 states and 163 transitions. Complement of second has 12 states. [2018-11-23 05:24:00,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 05:24:00,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 05:24:00,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2018-11-23 05:24:00,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 88 transitions. Stem has 3 letters. Loop has 13 letters. [2018-11-23 05:24:00,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:24:00,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 88 transitions. Stem has 16 letters. Loop has 13 letters. [2018-11-23 05:24:00,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:24:00,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 88 transitions. Stem has 3 letters. Loop has 26 letters. [2018-11-23 05:24:00,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:24:00,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 163 transitions. [2018-11-23 05:24:00,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-23 05:24:00,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 89 states and 114 transitions. [2018-11-23 05:24:00,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-23 05:24:00,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-23 05:24:00,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 114 transitions. [2018-11-23 05:24:00,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 05:24:00,288 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 114 transitions. [2018-11-23 05:24:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 114 transitions. [2018-11-23 05:24:00,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 69. [2018-11-23 05:24:00,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 05:24:00,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2018-11-23 05:24:00,310 INFO L728 BuchiCegarLoop]: Abstraction has 69 states and 92 transitions. [2018-11-23 05:24:00,310 INFO L608 BuchiCegarLoop]: Abstraction has 69 states and 92 transitions. [2018-11-23 05:24:00,310 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 05:24:00,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 92 transitions. [2018-11-23 05:24:00,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-23 05:24:00,312 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 05:24:00,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 05:24:00,312 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:24:00,312 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:24:00,313 INFO L794 eck$LassoCheckResult]: Stem: 299#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 295#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~ret17.base, main_#t~ret17.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~the_int~0;main_~in_len~0 := main_#t~nondet14;havoc main_#t~nondet14; 296#L520 assume !(main_~in_len~0 < 1);call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~the_int~0 := main_#t~nondet16;havoc main_#t~nondet16;strrchr_#in~t.base, strrchr_#in~t.offset, strrchr_#in~c := main_~in~0.base, main_~in~0.offset, main_~the_int~0;havoc strrchr_#res.base, strrchr_#res.offset;havoc strrchr_#t~mem2, strrchr_#t~mem3, strrchr_#t~pre4.base, strrchr_#t~pre4.offset, strrchr_#t~mem5, strrchr_#t~mem6, strrchr_#t~pre7.base, strrchr_#t~pre7.offset, strrchr_#t~mem8, strrchr_#t~mem9, strrchr_#t~pre10.base, strrchr_#t~pre10.offset, strrchr_#t~mem11, strrchr_#t~mem12, strrchr_#t~pre13.base, strrchr_#t~pre13.offset, strrchr_~t.base, strrchr_~t.offset, strrchr_~c, strrchr_~ch~0, strrchr_~l~0.base, strrchr_~l~0.offset;strrchr_~t.base, strrchr_~t.offset := strrchr_#in~t.base, strrchr_#in~t.offset;strrchr_~c := strrchr_#in~c;havoc strrchr_~ch~0;strrchr_~l~0.base, strrchr_~l~0.offset := 0, 0;strrchr_~ch~0 := (if strrchr_~c % 256 <= 127 then strrchr_~c % 256 else strrchr_~c % 256 - 256); 300#L510-2 assume !false;call strrchr_#t~mem2 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 328#L511 assume !(strrchr_#t~mem2 == strrchr_~ch~0);havoc strrchr_#t~mem2; 337#L511-2 call strrchr_#t~mem3 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 336#L511-3 assume !(0 == strrchr_#t~mem3);havoc strrchr_#t~mem3;strrchr_#t~pre4.base, strrchr_#t~pre4.offset := strrchr_~t.base, 1 + strrchr_~t.offset;strrchr_~t.base, strrchr_~t.offset := strrchr_~t.base, 1 + strrchr_~t.offset;havoc strrchr_#t~pre4.base, strrchr_#t~pre4.offset;call strrchr_#t~mem5 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 335#L512 assume strrchr_#t~mem5 == strrchr_~ch~0;havoc strrchr_#t~mem5;strrchr_~l~0.base, strrchr_~l~0.offset := strrchr_~t.base, strrchr_~t.offset; 334#L512-2 call strrchr_#t~mem6 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 304#L512-3 assume !(0 == strrchr_#t~mem6);havoc strrchr_#t~mem6;strrchr_#t~pre7.base, strrchr_#t~pre7.offset := strrchr_~t.base, 1 + strrchr_~t.offset;strrchr_~t.base, strrchr_~t.offset := strrchr_~t.base, 1 + strrchr_~t.offset;havoc strrchr_#t~pre7.base, strrchr_#t~pre7.offset;call strrchr_#t~mem8 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 305#L513 assume !(strrchr_#t~mem8 == strrchr_~ch~0);havoc strrchr_#t~mem8; 277#L513-2 [2018-11-23 05:24:00,313 INFO L796 eck$LassoCheckResult]: Loop: 277#L513-2 call strrchr_#t~mem9 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 293#L513-3 assume !(0 == strrchr_#t~mem9);havoc strrchr_#t~mem9;strrchr_#t~pre10.base, strrchr_#t~pre10.offset := strrchr_~t.base, 1 + strrchr_~t.offset;strrchr_~t.base, strrchr_~t.offset := strrchr_~t.base, 1 + strrchr_~t.offset;havoc strrchr_#t~pre10.base, strrchr_#t~pre10.offset;call strrchr_#t~mem11 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 272#L514 assume !(strrchr_#t~mem11 == strrchr_~ch~0);havoc strrchr_#t~mem11; 273#L514-2 call strrchr_#t~mem12 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 280#L514-3 assume !(0 == strrchr_#t~mem12);havoc strrchr_#t~mem12;strrchr_#t~pre13.base, strrchr_#t~pre13.offset := strrchr_~t.base, 1 + strrchr_~t.offset;strrchr_~t.base, strrchr_~t.offset := strrchr_~t.base, 1 + strrchr_~t.offset;havoc strrchr_#t~pre13.base, strrchr_#t~pre13.offset; 286#L510-2 assume !false;call strrchr_#t~mem2 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 289#L511 assume strrchr_#t~mem2 == strrchr_~ch~0;havoc strrchr_#t~mem2;strrchr_~l~0.base, strrchr_~l~0.offset := strrchr_~t.base, strrchr_~t.offset; 290#L511-2 call strrchr_#t~mem3 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 301#L511-3 assume !(0 == strrchr_#t~mem3);havoc strrchr_#t~mem3;strrchr_#t~pre4.base, strrchr_#t~pre4.offset := strrchr_~t.base, 1 + strrchr_~t.offset;strrchr_~t.base, strrchr_~t.offset := strrchr_~t.base, 1 + strrchr_~t.offset;havoc strrchr_#t~pre4.base, strrchr_#t~pre4.offset;call strrchr_#t~mem5 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 282#L512 assume !(strrchr_#t~mem5 == strrchr_~ch~0);havoc strrchr_#t~mem5; 283#L512-2 call strrchr_#t~mem6 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 297#L512-3 assume !(0 == strrchr_#t~mem6);havoc strrchr_#t~mem6;strrchr_#t~pre7.base, strrchr_#t~pre7.offset := strrchr_~t.base, 1 + strrchr_~t.offset;strrchr_~t.base, strrchr_~t.offset := strrchr_~t.base, 1 + strrchr_~t.offset;havoc strrchr_#t~pre7.base, strrchr_#t~pre7.offset;call strrchr_#t~mem8 := read~int(strrchr_~t.base, strrchr_~t.offset, 1); 276#L513 assume !(strrchr_#t~mem8 == strrchr_~ch~0);havoc strrchr_#t~mem8; 277#L513-2 [2018-11-23 05:24:00,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:24:00,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1567036087, now seen corresponding path program 1 times [2018-11-23 05:24:00,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:24:00,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:24:00,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:00,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:24:00,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:00,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:24:00,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1564022906, now seen corresponding path program 1 times [2018-11-23 05:24:00,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:24:00,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:24:00,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:00,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:24:00,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:00,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:24:00,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1332056944, now seen corresponding path program 1 times [2018-11-23 05:24:00,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 05:24:00,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 05:24:00,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:00,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:24:00,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:24:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:24:00,536 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 80 [2018-11-23 05:24:00,808 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 110 [2018-11-23 05:24:01,132 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 85 [2018-11-23 05:24:01,134 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 05:24:01,134 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 05:24:01,134 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 05:24:01,135 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 05:24:01,135 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 05:24:01,135 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 05:24:01,135 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 05:24:01,135 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 05:24:01,135 INFO L131 ssoRankerPreferences]: Filename of dumped script: strrchr_true-termination.c.i_Iteration2_Lasso [2018-11-23 05:24:01,135 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 05:24:01,135 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 05:24:01,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 05:24:01,241 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 05:24:01,472 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2018-11-23 05:24:01,727 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 05:24:01,729 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-23 05:24:02,598 WARN L180 SmtUtils]: Spent 815.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 61 [2018-11-23 05:24:04,956 WARN L180 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 170 DAG size of output: 114 [2018-11-23 05:24:04,989 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 05:24:04,990 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 05:24:04,990 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-23 05:24:04,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:04,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:04,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:04,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:04,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:04,992 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:04,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:04,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:04,993 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-23 05:24:04,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:04,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:04,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:04,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:04,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:04,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:04,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:04,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:04,994 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-23 05:24:04,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:04,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:04,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:04,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:04,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:04,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:04,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:04,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:04,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-23 05:24:04,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:04,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:04,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:04,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:04,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:24:04,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:04,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:04,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:04,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:04,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:04,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:04,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:04,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:24:04,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:04,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:04,999 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-23 05:24:04,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:05,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:05,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:05,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:05,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:05,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:05,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:05,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,007 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-23 05:24:05,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:05,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:05,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:05,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,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-23 05:24:05,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:05,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:05,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:05,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,010 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-23 05:24:05,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:05,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:05,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:05,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,019 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-23 05:24:05,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:05,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,020 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:05,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:05,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,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-23 05:24:05,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:05,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:05,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:05,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,022 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-23 05:24:05,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:05,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:05,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:05,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:05,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:24:05,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:05,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,032 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-23 05:24:05,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:05,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:05,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:05,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,034 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-23 05:24:05,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:05,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:05,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:05,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,035 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-23 05:24:05,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:05,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:05,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:05,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:05,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:05,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:05,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:05,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,039 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-23 05:24:05,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:05,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:05,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:05,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,040 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-23 05:24:05,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:05,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:05,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:05,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,042 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-23 05:24:05,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:05,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:05,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:05,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,043 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-23 05:24:05,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:05,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:05,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:05,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,045 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-23 05:24:05,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:05,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:05,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:05,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,046 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-23 05:24:05,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:05,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:05,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:05,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:05,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:05,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:05,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:05,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,049 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-23 05:24:05,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 05:24:05,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,050 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 05:24:05,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 05:24:05,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 05:24:05,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:05,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:24:05,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:05,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,056 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-23 05:24:05,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,056 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 05:24:05,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:05,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:05,058 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 05:24:05,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:05,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:05,063 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-23 05:24:05,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:05,063 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2018-11-23 05:24:05,063 INFO L206 nArgumentSynthesizer]: 72 loop disjuncts [2018-11-23 05:24:05,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:07,631 INFO L402 nArgumentSynthesizer]: We have 12240 Motzkin's Theorem applications. [2018-11-23 05:24:07,631 INFO L403 nArgumentSynthesizer]: A total of 144 supporting invariants were added. [2018-11-23 05:24:25,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:25,700 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-23 05:24:25,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:25,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:25,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:25,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:25,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:24:25,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:25,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:25,702 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-23 05:24:25,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:25,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:25,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:25,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:25,703 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:24:25,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:25,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 05:24:25,704 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-23 05:24:25,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 05:24:25,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 05:24:25,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 05:24:25,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 05:24:25,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 05:24:25,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 05:24:25,722 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 05:24:25,739 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 05:24:25,740 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 05:24:25,740 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 05:24:25,740 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 05:24:25,741 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 05:24:25,741 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc15.base)_2, ULTIMATE.start_strrchr_~t.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc15.base)_2 - 1*ULTIMATE.start_strrchr_~t.offset Supporting invariants [] [2018-11-23 05:24:25,767 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-23 05:24:25,769 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 05:24:25,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:24:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:24:25,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:24:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:24:25,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:24:25,862 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-23 05:24:25,862 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 05:24:25,863 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 92 transitions. cyclomatic complexity: 25 Second operand 8 states. [2018-11-23 05:24:25,929 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 92 transitions. cyclomatic complexity: 25. Second operand 8 states. Result 162 states and 219 transitions. Complement of second has 7 states. [2018-11-23 05:24:25,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 05:24:25,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 05:24:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2018-11-23 05:24:25,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 11 letters. Loop has 13 letters. [2018-11-23 05:24:25,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:24:25,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 24 letters. Loop has 13 letters. [2018-11-23 05:24:25,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:24:25,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 11 letters. Loop has 26 letters. [2018-11-23 05:24:25,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 05:24:25,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 219 transitions. [2018-11-23 05:24:25,935 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 05:24:25,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 0 states and 0 transitions. [2018-11-23 05:24:25,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 05:24:25,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 05:24:25,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 05:24:25,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 05:24:25,935 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:24:25,935 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:24:25,935 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:24:25,936 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 05:24:25,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 05:24:25,936 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 05:24:25,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 05:24:25,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 05:24:25 BoogieIcfgContainer [2018-11-23 05:24:25,940 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 05:24:25,940 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:24:25,940 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:24:25,940 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:24:25,941 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:23:57" (3/4) ... [2018-11-23 05:24:25,944 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 05:24:25,944 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:24:25,944 INFO L168 Benchmark]: Toolchain (without parser) took 29033.28 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 3.0 GB). Free memory was 956.4 MB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-23 05:24:25,945 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:24:25,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. [2018-11-23 05:24:25,946 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.66 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 05:24:25,946 INFO L168 Benchmark]: Boogie Preprocessor took 17.75 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 05:24:25,947 INFO L168 Benchmark]: RCFGBuilder took 208.12 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: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2018-11-23 05:24:25,947 INFO L168 Benchmark]: BuchiAutomizer took 28418.61 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-23 05:24:25,947 INFO L168 Benchmark]: Witness Printer took 3.88 ms. Allocated memory is still 4.0 GB. Free memory is still 2.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:24:25,951 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 351.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -180.8 MB). Peak memory consumption was 28.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.66 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.75 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 208.12 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: 22.3 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 28418.61 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 2.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 3.88 ms. Allocated memory is still 4.0 GB. Free memory is still 2.4 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 5 * unknown-#length-unknown[__builtin_alloca (in_len)] + -4 * l and consists of 7 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (in_len)] + -1 * t and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 28.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 27.4s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 20 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 69 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 26 SDtfs, 114 SDslu, 40 SDs, 0 SdLazy, 236 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital336 mio100 ax100 hnf99 lsp76 ukn96 mio100 lsp41 div124 bol100 ite100 ukn100 eq171 hnf79 smp78 dnf3074 smp44 tf100 neg91 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20636ms VariablesStem: 10 VariablesLoop: 8 DisjunctsStem: 12 DisjunctsLoop: 72 SupportingInvariants: 144 MotzkinApplications: 12240 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...