./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strtok_r_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_3a134afb-d0a0-40ed-9846-152b31692f37/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3a134afb-d0a0-40ed-9846-152b31692f37/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3a134afb-d0a0-40ed-9846-152b31692f37/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3a134afb-d0a0-40ed-9846-152b31692f37/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strtok_r_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3a134afb-d0a0-40ed-9846-152b31692f37/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3a134afb-d0a0-40ed-9846-152b31692f37/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 1697f909ede7c89de56057e54b84d7ae7cf0bcac .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 13:06:20,544 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:06:20,545 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:06:20,551 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:06:20,551 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:06:20,552 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:06:20,552 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:06:20,554 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:06:20,555 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:06:20,555 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:06:20,556 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:06:20,556 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:06:20,557 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:06:20,557 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:06:20,558 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:06:20,558 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:06:20,559 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:06:20,560 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:06:20,561 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:06:20,562 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:06:20,563 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:06:20,563 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:06:20,565 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:06:20,565 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:06:20,565 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:06:20,566 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:06:20,567 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:06:20,567 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:06:20,567 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:06:20,568 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:06:20,568 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:06:20,569 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:06:20,569 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:06:20,569 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:06:20,570 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:06:20,570 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:06:20,570 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3a134afb-d0a0-40ed-9846-152b31692f37/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 13:06:20,580 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:06:20,580 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:06:20,581 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:06:20,581 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:06:20,582 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:06:20,582 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 13:06:20,582 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 13:06:20,582 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 13:06:20,582 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 13:06:20,582 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 13:06:20,582 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 13:06:20,583 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:06:20,583 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:06:20,583 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:06:20,583 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:06:20,583 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 13:06:20,583 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 13:06:20,583 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 13:06:20,583 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:06:20,584 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 13:06:20,584 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:06:20,584 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 13:06:20,584 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:06:20,584 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:06:20,584 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 13:06:20,584 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:06:20,585 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:06:20,585 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 13:06:20,585 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 13:06:20,585 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_3a134afb-d0a0-40ed-9846-152b31692f37/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 -> 1697f909ede7c89de56057e54b84d7ae7cf0bcac [2018-11-23 13:06:20,610 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:06:20,619 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:06:20,621 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:06:20,622 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:06:20,622 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:06:20,623 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3a134afb-d0a0-40ed-9846-152b31692f37/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strtok_r_true-termination.c.i [2018-11-23 13:06:20,665 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a134afb-d0a0-40ed-9846-152b31692f37/bin-2019/uautomizer/data/04fd2c0a4/450e89e8cbb140ecb5c33803d5214e3a/FLAGa52d3022b [2018-11-23 13:06:21,100 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:06:21,100 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3a134afb-d0a0-40ed-9846-152b31692f37/sv-benchmarks/c/termination-libowfat/strtok_r_true-termination.c.i [2018-11-23 13:06:21,111 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3a134afb-d0a0-40ed-9846-152b31692f37/bin-2019/uautomizer/data/04fd2c0a4/450e89e8cbb140ecb5c33803d5214e3a/FLAGa52d3022b [2018-11-23 13:06:21,122 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3a134afb-d0a0-40ed-9846-152b31692f37/bin-2019/uautomizer/data/04fd2c0a4/450e89e8cbb140ecb5c33803d5214e3a [2018-11-23 13:06:21,124 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:06:21,125 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:06:21,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:06:21,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:06:21,128 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:06:21,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:21" (1/1) ... [2018-11-23 13:06:21,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a3379 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:21, skipping insertion in model container [2018-11-23 13:06:21,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:21" (1/1) ... [2018-11-23 13:06:21,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:06:21,163 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:06:21,361 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:06:21,368 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:06:21,453 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:06:21,485 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:06:21,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:21 WrapperNode [2018-11-23 13:06:21,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:06:21,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:06:21,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:06:21,486 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:06:21,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:21" (1/1) ... [2018-11-23 13:06:21,503 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:21" (1/1) ... [2018-11-23 13:06:21,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:06:21,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:06:21,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:06:21,518 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:06:21,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:21" (1/1) ... [2018-11-23 13:06:21,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:21" (1/1) ... [2018-11-23 13:06:21,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:21" (1/1) ... [2018-11-23 13:06:21,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:21" (1/1) ... [2018-11-23 13:06:21,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:21" (1/1) ... [2018-11-23 13:06:21,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:21" (1/1) ... [2018-11-23 13:06:21,539 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:21" (1/1) ... [2018-11-23 13:06:21,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:06:21,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:06:21,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:06:21,542 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:06:21,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a134afb-d0a0-40ed-9846-152b31692f37/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 13:06:21,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:06:21,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:06:21,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:06:21,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 13:06:21,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 13:06:21,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:06:21,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 13:06:21,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:06:21,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:06:21,850 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:06:21,850 INFO L280 CfgBuilder]: Removed 14 assue(true) statements. [2018-11-23 13:06:21,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:21 BoogieIcfgContainer [2018-11-23 13:06:21,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:06:21,850 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 13:06:21,850 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 13:06:21,853 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 13:06:21,853 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:06:21,853 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:06:21" (1/3) ... [2018-11-23 13:06:21,854 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c74fb69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:06:21, skipping insertion in model container [2018-11-23 13:06:21,854 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:06:21,854 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:21" (2/3) ... [2018-11-23 13:06:21,854 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c74fb69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:06:21, skipping insertion in model container [2018-11-23 13:06:21,854 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:06:21,854 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:21" (3/3) ... [2018-11-23 13:06:21,855 INFO L375 chiAutomizerObserver]: Analyzing ICFG strtok_r_true-termination.c.i [2018-11-23 13:06:21,892 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:06:21,893 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 13:06:21,893 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 13:06:21,893 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 13:06:21,893 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:06:21,893 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:06:21,893 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 13:06:21,893 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:06:21,894 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 13:06:21,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2018-11-23 13:06:21,920 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-23 13:06:21,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:21,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:21,926 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 13:06:21,926 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 13:06:21,926 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 13:06:21,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2018-11-23 13:06:21,928 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-23 13:06:21,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:21,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:21,929 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 13:06:21,929 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 13:06:21,936 INFO L794 eck$LassoCheckResult]: Stem: 30#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 7#L544true assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 3#L548true assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 9#L532true assume strtok_r_~s.base == 0 && strtok_r_~s.offset == 0;call strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset := read~$Pointer$(strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, 8);strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset; 12#L532-2true strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 20#L510-4true [2018-11-23 13:06:21,936 INFO L796 eck$LassoCheckResult]: Loop: 20#L510-4true call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 11#L510-1true assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 21#L511-6true assume !true; 22#L511-7true call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 25#L512true assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 16#L510-3true strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 20#L510-4true [2018-11-23 13:06:21,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:21,940 INFO L82 PathProgramCache]: Analyzing trace with hash 889571276, now seen corresponding path program 1 times [2018-11-23 13:06:21,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:21,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:21,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:21,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:21,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:22,051 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 13:06:22,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:06:22,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:06:22,055 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:06:22,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:22,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1573281738, now seen corresponding path program 1 times [2018-11-23 13:06:22,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:22,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:22,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:22,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:22,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:22,063 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 13:06:22,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:06:22,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:06:22,064 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:06:22,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:06:22,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:06:22,080 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-23 13:06:22,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:22,087 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2018-11-23 13:06:22,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:06:22,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 45 transitions. [2018-11-23 13:06:22,090 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-23 13:06:22,093 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 26 states and 32 transitions. [2018-11-23 13:06:22,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-23 13:06:22,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-23 13:06:22,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2018-11-23 13:06:22,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:06:22,095 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-23 13:06:22,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2018-11-23 13:06:22,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 13:06:22,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:06:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2018-11-23 13:06:22,119 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-23 13:06:22,119 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2018-11-23 13:06:22,119 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 13:06:22,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2018-11-23 13:06:22,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-23 13:06:22,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:22,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:22,120 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 13:06:22,120 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:22,120 INFO L794 eck$LassoCheckResult]: Stem: 102#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 86#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 85#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 78#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 79#L532 assume strtok_r_~s.base == 0 && strtok_r_~s.offset == 0;call strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset := read~$Pointer$(strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, 8);strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset; 87#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 92#L510-4 [2018-11-23 13:06:22,121 INFO L796 eck$LassoCheckResult]: Loop: 92#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 90#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 91#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 96#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 101#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 97#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 98#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 94#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 92#L510-4 [2018-11-23 13:06:22,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:22,121 INFO L82 PathProgramCache]: Analyzing trace with hash 889571276, now seen corresponding path program 2 times [2018-11-23 13:06:22,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:22,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:22,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:22,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:22,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:22,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:22,160 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 13:06:22,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:06:22,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:06:22,160 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:06:22,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:22,161 INFO L82 PathProgramCache]: Analyzing trace with hash -347496813, now seen corresponding path program 1 times [2018-11-23 13:06:22,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:22,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:22,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:22,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:22,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:22,312 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2018-11-23 13:06:22,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:06:22,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:06:22,346 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-11-23 13:06:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:22,378 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-11-23 13:06:22,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:06:22,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 31 transitions. [2018-11-23 13:06:22,379 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-23 13:06:22,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 31 transitions. [2018-11-23 13:06:22,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-23 13:06:22,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-23 13:06:22,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 31 transitions. [2018-11-23 13:06:22,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:06:22,380 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-23 13:06:22,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 31 transitions. [2018-11-23 13:06:22,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 13:06:22,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 13:06:22,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-23 13:06:22,382 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-23 13:06:22,382 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-23 13:06:22,382 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 13:06:22,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 31 transitions. [2018-11-23 13:06:22,383 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2018-11-23 13:06:22,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:22,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:22,383 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 13:06:22,383 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:22,384 INFO L794 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 147#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 146#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 139#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 140#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 148#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 153#L510-4 [2018-11-23 13:06:22,384 INFO L796 eck$LassoCheckResult]: Loop: 153#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 151#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 152#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 157#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 162#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 158#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 159#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 155#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 153#L510-4 [2018-11-23 13:06:22,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:22,384 INFO L82 PathProgramCache]: Analyzing trace with hash 889571338, now seen corresponding path program 1 times [2018-11-23 13:06:22,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:22,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:22,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:22,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:22,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:22,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:22,412 INFO L82 PathProgramCache]: Analyzing trace with hash -347496813, now seen corresponding path program 2 times [2018-11-23 13:06:22,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:22,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:22,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:22,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:22,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:22,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:22,426 INFO L82 PathProgramCache]: Analyzing trace with hash -126923364, now seen corresponding path program 1 times [2018-11-23 13:06:22,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:22,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:22,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:22,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:22,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:22,582 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2018-11-23 13:06:22,939 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 140 [2018-11-23 13:06:23,113 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-23 13:06:23,120 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:06:23,121 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:06:23,121 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:06:23,121 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:06:23,121 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:06:23,121 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:06:23,121 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:06:23,121 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:06:23,121 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration3_Lasso [2018-11-23 13:06:23,121 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:06:23,122 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:06:23,134 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 13:06:23,137 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 13:06:23,138 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 13:06:23,139 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 13:06:23,141 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 13:06:23,143 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 13:06:23,144 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 13:06:23,146 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 13:06:23,147 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 13:06:23,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 13:06:23,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 13:06:23,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 13:06:23,151 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 13:06:23,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 13:06:23,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 13:06:23,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 13:06:23,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 13:06:23,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 13:06:23,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 13:06:23,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 13:06:23,162 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 13:06:23,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 13:06:23,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 13:06:23,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 13:06:23,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 13:06:23,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 13:06:23,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 13:06:23,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 13:06:23,183 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 13:06:23,185 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 13:06:23,191 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 13:06:23,193 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 13:06:23,458 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2018-11-23 13:06:23,521 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 13:06:23,837 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:06:23,840 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:06:23,841 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 13:06:23,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,846 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 13:06:23,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,848 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 13:06:23,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,850 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 13:06:23,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:23,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:23,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,856 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 13:06:23,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:23,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:23,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,863 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 13:06:23,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,864 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,865 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 13:06:23,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:23,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,869 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 13:06:23,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,871 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 13:06:23,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,873 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 13:06:23,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:23,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:23,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,877 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 13:06:23,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,879 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 13:06:23,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:23,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,884 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 13:06:23,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,885 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:23,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,889 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 13:06:23,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,891 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 13:06:23,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:23,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:23,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:23,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,898 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 13:06:23,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,900 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 13:06:23,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,902 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 13:06:23,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,904 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 13:06:23,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,904 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,905 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 13:06:23,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,906 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,906 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,907 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 13:06:23,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,909 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 13:06:23,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,911 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 13:06:23,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,924 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 13:06:23,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,925 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:23,925 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:23,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,933 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 13:06:23,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:23,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,937 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 13:06:23,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,939 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 13:06:23,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,940 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 13:06:23,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,941 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 13:06:23,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,944 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 13:06:23,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:23,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:23,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,948 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 13:06:23,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:23,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:23,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:23,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,950 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 13:06:23,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:23,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:23,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,954 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 13:06:23,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,956 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:23,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:23,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,959 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 13:06:23,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:23,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:23,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,963 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 13:06:23,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,965 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:23,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:23,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:23,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:23,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:23,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:23,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,978 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:23,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,980 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:23,980 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:23,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,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 13:06:23,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:23,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:23,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:23,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 13:06:23,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:23,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:23,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:23,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:23,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:23,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:24,017 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:06:24,035 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 13:06:24,035 INFO L444 ModelExtractionUtils]: 23 out of 31 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-23 13:06:24,036 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:06:24,037 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:06:24,037 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:06:24,038 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strspn_~s.base)_1, ULTIMATE.start_strspn_~s.offset) = 1*v_rep(select #length ULTIMATE.start_strspn_~s.base)_1 - 1*ULTIMATE.start_strspn_~s.offset Supporting invariants [] [2018-11-23 13:06:24,091 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2018-11-23 13:06:24,096 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 13:06:24,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:24,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:24,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:24,146 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 13:06:24,148 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:06:24,149 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-23 13:06:24,186 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 31 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 46 states and 57 transitions. Complement of second has 4 states. [2018-11-23 13:06:24,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:24,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:06:24,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2018-11-23 13:06:24,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-23 13:06:24,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:24,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 14 letters. Loop has 8 letters. [2018-11-23 13:06:24,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:24,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 6 letters. Loop has 16 letters. [2018-11-23 13:06:24,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:24,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 57 transitions. [2018-11-23 13:06:24,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-23 13:06:24,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 34 states and 42 transitions. [2018-11-23 13:06:24,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-23 13:06:24,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-23 13:06:24,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2018-11-23 13:06:24,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:24,192 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-23 13:06:24,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2018-11-23 13:06:24,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 13:06:24,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 13:06:24,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2018-11-23 13:06:24,194 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-23 13:06:24,194 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-23 13:06:24,194 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 13:06:24,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2018-11-23 13:06:24,195 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-23 13:06:24,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:24,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:24,195 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:24,195 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:06:24,195 INFO L794 eck$LassoCheckResult]: Stem: 352#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 329#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 328#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 321#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 322#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 330#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 337#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 333#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 334#L511-6 [2018-11-23 13:06:24,195 INFO L796 eck$LassoCheckResult]: Loop: 334#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 342#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 350#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 353#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 334#L511-6 [2018-11-23 13:06:24,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:24,196 INFO L82 PathProgramCache]: Analyzing trace with hash 179564655, now seen corresponding path program 1 times [2018-11-23 13:06:24,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:24,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:24,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:24,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:24,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:24,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:24,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1911846, now seen corresponding path program 1 times [2018-11-23 13:06:24,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:24,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:24,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:24,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:24,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:24,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:24,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1251527276, now seen corresponding path program 1 times [2018-11-23 13:06:24,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:24,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:24,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:24,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:24,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:24,631 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 154 [2018-11-23 13:06:24,767 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-11-23 13:06:24,768 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:06:24,769 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:06:24,769 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:06:24,769 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:06:24,769 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:06:24,769 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:06:24,769 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:06:24,769 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:06:24,769 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration4_Lasso [2018-11-23 13:06:24,769 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:06:24,769 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:06:24,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:24,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:24,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:24,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:24,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:24,779 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 13:06:24,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:24,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:24,782 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 13:06:24,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:24,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:24,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:24,786 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 13:06:24,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:24,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:24,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:24,794 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 13:06:24,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:24,797 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 13:06:24,799 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 13:06:24,800 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 13:06:24,801 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 13:06:24,802 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 13:06:24,803 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 13:06:24,804 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 13:06:24,805 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 13:06:24,806 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 13:06:24,807 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 13:06:24,807 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 13:06:24,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:24,822 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 13:06:25,138 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 110 [2018-11-23 13:06:25,187 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 13:06:25,188 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 13:06:25,597 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:06:25,597 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:06:25,597 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 13:06:25,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,599 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 13:06:25,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,604 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 13:06:25,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:25,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:25,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:25,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,608 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 13:06:25,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,609 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 13:06:25,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:25,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:25,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,614 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 13:06:25,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,616 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 13:06:25,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,617 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 13:06:25,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:25,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:25,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:25,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,621 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:25,621 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:25,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,622 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 13:06:25,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,624 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 13:06:25,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,625 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 13:06:25,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:25,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,628 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,628 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 13:06:25,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:25,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,631 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 13:06:25,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,633 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 13:06:25,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:25,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:25,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:25,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,637 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 13:06:25,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,638 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 13:06:25,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,640 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 13:06:25,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:25,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,643 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 13:06:25,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,644 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 13:06:25,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:25,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,648 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 13:06:25,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,649 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 13:06:25,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,650 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,651 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 13:06:25,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:25,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:25,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:25,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,655 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:25,655 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:25,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,657 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 13:06:25,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:25,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:25,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:25,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,658 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 13:06:25,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:25,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:25,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,662 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 13:06:25,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,662 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:25,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,663 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:25,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:25,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,671 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 13:06:25,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:25,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:25,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,673 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 13:06:25,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:25,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:25,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:25,679 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 13:06:25,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:25,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:25,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:25,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:25,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:25,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:25,722 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:06:25,739 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 13:06:25,739 INFO L444 ModelExtractionUtils]: 57 out of 64 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 13:06:25,739 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:06:25,740 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:06:25,740 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:06:25,740 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strspn_~a~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_2) = -1*ULTIMATE.start_strspn_~a~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc27.base)_2 Supporting invariants [] [2018-11-23 13:06:25,853 INFO L297 tatePredicateManager]: 21 out of 22 supporting invariants were superfluous and have been removed [2018-11-23 13:06:25,855 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 13:06:25,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:25,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:25,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:25,927 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 13:06:25,928 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-23 13:06:25,928 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-23 13:06:26,019 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 42 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 100 states and 123 transitions. Complement of second has 7 states. [2018-11-23 13:06:26,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:26,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:06:26,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-11-23 13:06:26,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-23 13:06:26,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:26,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 12 letters. Loop has 4 letters. [2018-11-23 13:06:26,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:26,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 45 transitions. Stem has 8 letters. Loop has 8 letters. [2018-11-23 13:06:26,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:26,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 123 transitions. [2018-11-23 13:06:26,022 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2018-11-23 13:06:26,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 79 states and 99 transitions. [2018-11-23 13:06:26,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-11-23 13:06:26,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-23 13:06:26,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 99 transitions. [2018-11-23 13:06:26,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:26,024 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 99 transitions. [2018-11-23 13:06:26,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 99 transitions. [2018-11-23 13:06:26,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 49. [2018-11-23 13:06:26,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:06:26,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2018-11-23 13:06:26,029 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2018-11-23 13:06:26,029 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2018-11-23 13:06:26,029 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 13:06:26,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 65 transitions. [2018-11-23 13:06:26,030 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-23 13:06:26,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:26,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:26,030 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:26,030 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 13:06:26,031 INFO L794 eck$LassoCheckResult]: Stem: 646#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 620#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 619#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 612#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 613#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 621#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 628#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 624#L510-1 assume !(0 != strspn_#t~mem10);havoc strspn_#t~mem10; 614#L510-5 strspn_#res := strspn_~l~0; 615#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 632#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 623#L523-4 [2018-11-23 13:06:26,031 INFO L796 eck$LassoCheckResult]: Loop: 623#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 629#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 643#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 616#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 617#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 622#L523-3 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 623#L523-4 [2018-11-23 13:06:26,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:26,031 INFO L82 PathProgramCache]: Analyzing trace with hash -2118613646, now seen corresponding path program 1 times [2018-11-23 13:06:26,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:26,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:26,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:26,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:26,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:26,231 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 13:06:26,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:06:26,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 13:06:26,232 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:06:26,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:26,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1361307093, now seen corresponding path program 1 times [2018-11-23 13:06:26,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:26,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:26,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:26,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:26,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:26,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:06:26,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:06:26,302 INFO L87 Difference]: Start difference. First operand 49 states and 65 transitions. cyclomatic complexity: 21 Second operand 9 states. [2018-11-23 13:06:26,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:26,505 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2018-11-23 13:06:26,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:06:26,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 73 transitions. [2018-11-23 13:06:26,507 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-23 13:06:26,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 55 states and 70 transitions. [2018-11-23 13:06:26,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-23 13:06:26,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-23 13:06:26,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 70 transitions. [2018-11-23 13:06:26,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:26,508 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 70 transitions. [2018-11-23 13:06:26,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 70 transitions. [2018-11-23 13:06:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2018-11-23 13:06:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 13:06:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2018-11-23 13:06:26,510 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-11-23 13:06:26,510 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-11-23 13:06:26,510 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 13:06:26,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 64 transitions. [2018-11-23 13:06:26,511 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2018-11-23 13:06:26,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:26,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:26,511 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:26,511 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-23 13:06:26,511 INFO L794 eck$LassoCheckResult]: Stem: 777#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 751#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 750#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 743#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 744#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 752#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 759#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 764#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 782#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 781#L511-1 assume !strspn_#t~short7; 778#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 768#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 769#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 745#L510-5 strspn_#res := strspn_~l~0; 746#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 763#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 754#L523-4 [2018-11-23 13:06:26,512 INFO L796 eck$LassoCheckResult]: Loop: 754#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 760#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 773#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 747#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 748#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 753#L523-3 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 754#L523-4 [2018-11-23 13:06:26,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:26,512 INFO L82 PathProgramCache]: Analyzing trace with hash 60685095, now seen corresponding path program 1 times [2018-11-23 13:06:26,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:26,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:26,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:26,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:26,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:26,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:26,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1361307093, now seen corresponding path program 2 times [2018-11-23 13:06:26,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:26,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:26,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:26,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:26,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:26,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:26,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1593745617, now seen corresponding path program 1 times [2018-11-23 13:06:26,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:26,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:26,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:26,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:26,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:27,201 WARN L180 SmtUtils]: Spent 584.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 196 [2018-11-23 13:06:27,387 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2018-11-23 13:06:27,389 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:06:27,389 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:06:27,389 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:06:27,389 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:06:27,389 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:06:27,389 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:06:27,389 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:06:27,389 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:06:27,389 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration6_Lasso [2018-11-23 13:06:27,390 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:06:27,390 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:06:27,392 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 13:06:27,399 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 13:06:27,400 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 13:06:27,401 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 13:06:27,402 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 13:06:27,403 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 13:06:27,405 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 13:06:27,407 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 13:06:27,410 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 13:06:27,411 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 13:06:27,413 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 13:06:27,415 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 13:06:27,417 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 13:06:27,418 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 13:06:27,420 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 13:06:27,422 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 13:06:27,423 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 13:06:27,425 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 13:06:27,427 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 13:06:27,428 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 13:06:27,429 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 13:06:27,430 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 13:06:27,431 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 13:06:27,432 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 13:06:27,433 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 13:06:27,434 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 13:06:27,840 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 138 [2018-11-23 13:06:27,909 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 13:06:27,911 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 13:06:27,911 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 13:06:27,912 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 13:06:27,913 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 13:06:27,915 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 13:06:27,915 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 13:06:27,916 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 13:06:27,918 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 13:06:27,919 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 13:06:27,920 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 13:06:27,920 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 13:06:27,921 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 13:06:28,147 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 71 [2018-11-23 13:06:28,486 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:06:28,486 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:06:28,487 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 13:06:28,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:28,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,493 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 13:06:28,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:28,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,496 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 13:06:28,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,497 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 13:06:28,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,498 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 13:06:28,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:28,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:28,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:28,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,502 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 13:06:28,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,504 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 13:06:28,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,505 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 13:06:28,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,507 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 13:06:28,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:28,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,509 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,509 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 13:06:28,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,511 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 13:06:28,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,512 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 13:06:28,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,514 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 13:06:28,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:28,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:28,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,516 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 13:06:28,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,517 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 13:06:28,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,519 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 13:06:28,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,520 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 13:06:28,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,521 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,522 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 13:06:28,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,522 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:28,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,525 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 13:06:28,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,526 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 13:06:28,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,527 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 13:06:28,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:28,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:28,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:28,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,529 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 13:06:28,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:28,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:28,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,531 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 13:06:28,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:28,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:28,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:28,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:28,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:28,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:28,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,539 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:28,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,540 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:28,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:28,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,551 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 13:06:28,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:28,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:28,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,554 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 13:06:28,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,554 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:28,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,556 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:28,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:28,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,564 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 13:06:28,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:28,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:28,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:28,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:28,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:28,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:28,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:28,567 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:28,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:28,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:28,593 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:06:28,609 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 13:06:28,609 INFO L444 ModelExtractionUtils]: 73 out of 79 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 13:06:28,609 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:06:28,610 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:06:28,610 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:06:28,610 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc25.base)_3, ULTIMATE.start_strcspn_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc25.base)_3 - 1*ULTIMATE.start_strcspn_~s.offset Supporting invariants [] [2018-11-23 13:06:28,759 INFO L297 tatePredicateManager]: 30 out of 31 supporting invariants were superfluous and have been removed [2018-11-23 13:06:28,760 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 13:06:28,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:28,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:28,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:28,824 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 13:06:28,824 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-23 13:06:28,824 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 64 transitions. cyclomatic complexity: 20 Second operand 5 states. [2018-11-23 13:06:28,863 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 64 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 57 states and 74 transitions. Complement of second has 6 states. [2018-11-23 13:06:28,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:28,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:06:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-23 13:06:28,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 16 letters. Loop has 6 letters. [2018-11-23 13:06:28,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:28,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-23 13:06:28,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:28,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 16 letters. Loop has 12 letters. [2018-11-23 13:06:28,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:28,866 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 74 transitions. [2018-11-23 13:06:28,866 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 13:06:28,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 55 states and 72 transitions. [2018-11-23 13:06:28,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-23 13:06:28,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-23 13:06:28,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 72 transitions. [2018-11-23 13:06:28,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:28,867 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 72 transitions. [2018-11-23 13:06:28,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 72 transitions. [2018-11-23 13:06:28,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-23 13:06:28,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 13:06:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2018-11-23 13:06:28,870 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 72 transitions. [2018-11-23 13:06:28,870 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 72 transitions. [2018-11-23 13:06:28,870 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 13:06:28,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 72 transitions. [2018-11-23 13:06:28,870 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 13:06:28,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:28,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:28,871 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:28,871 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:06:28,871 INFO L794 eck$LassoCheckResult]: Stem: 1112#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1081#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 1080#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 1071#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 1072#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 1082#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 1089#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 1096#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 1124#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 1110#L511-1 assume !strspn_#t~short7; 1111#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 1103#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 1104#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 1093#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 1094#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 1097#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 1116#L511-6 [2018-11-23 13:06:28,871 INFO L796 eck$LassoCheckResult]: Loop: 1116#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 1119#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 1118#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 1115#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 1116#L511-6 [2018-11-23 13:06:28,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:28,873 INFO L82 PathProgramCache]: Analyzing trace with hash 60739587, now seen corresponding path program 1 times [2018-11-23 13:06:28,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:28,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:28,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:28,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:28,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:28,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:28,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:06:28,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:06:28,913 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:06:28,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:28,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1911846, now seen corresponding path program 2 times [2018-11-23 13:06:28,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:28,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:28,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:28,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:28,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:28,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:06:28,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:06:28,984 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. cyclomatic complexity: 23 Second operand 5 states. [2018-11-23 13:06:29,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:29,009 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2018-11-23 13:06:29,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:06:29,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 107 transitions. [2018-11-23 13:06:29,009 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2018-11-23 13:06:29,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 83 states and 103 transitions. [2018-11-23 13:06:29,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-23 13:06:29,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-23 13:06:29,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 103 transitions. [2018-11-23 13:06:29,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:29,010 INFO L705 BuchiCegarLoop]: Abstraction has 83 states and 103 transitions. [2018-11-23 13:06:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 103 transitions. [2018-11-23 13:06:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2018-11-23 13:06:29,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 13:06:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 72 transitions. [2018-11-23 13:06:29,012 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2018-11-23 13:06:29,012 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 72 transitions. [2018-11-23 13:06:29,012 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 13:06:29,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 72 transitions. [2018-11-23 13:06:29,012 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 13:06:29,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:29,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:29,013 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:29,013 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:06:29,013 INFO L794 eck$LassoCheckResult]: Stem: 1264#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1232#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 1231#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 1222#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 1223#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 1233#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 1240#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 1238#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 1239#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 1276#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 1269#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 1254#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 1255#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 1244#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 1245#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 1236#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 1237#L511-6 [2018-11-23 13:06:29,013 INFO L796 eck$LassoCheckResult]: Loop: 1237#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 1249#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 1275#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 1267#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 1237#L511-6 [2018-11-23 13:06:29,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:29,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1714267775, now seen corresponding path program 2 times [2018-11-23 13:06:29,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:29,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:29,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:29,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:29,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:29,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:29,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1911846, now seen corresponding path program 3 times [2018-11-23 13:06:29,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:29,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:29,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:29,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:29,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:29,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:29,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1311163814, now seen corresponding path program 1 times [2018-11-23 13:06:29,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:29,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:29,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:29,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:29,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:29,630 WARN L180 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 185 [2018-11-23 13:06:29,779 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 150 [2018-11-23 13:06:29,781 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:06:29,781 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:06:29,781 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:06:29,781 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:06:29,782 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:06:29,782 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:06:29,782 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:06:29,782 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:06:29,782 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration8_Lasso [2018-11-23 13:06:29,782 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:06:29,782 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:06:29,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:29,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:29,788 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 13:06:29,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:29,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:29,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:29,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:29,794 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 13:06:29,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:29,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:29,797 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 13:06:29,798 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 13:06:29,799 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 13:06:29,800 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 13:06:29,801 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 13:06:29,806 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 13:06:29,807 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 13:06:29,808 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 13:06:29,809 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 13:06:29,810 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 13:06:29,811 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 13:06:29,812 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 13:06:29,813 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 13:06:29,815 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 13:06:29,816 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 13:06:29,818 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 13:06:29,819 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 13:06:29,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:29,821 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 13:06:29,822 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 13:06:29,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:29,825 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 13:06:29,825 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 13:06:30,164 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 119 [2018-11-23 13:06:30,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:30,650 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:06:30,650 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:06:30,651 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 13:06:30,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,652 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 13:06:30,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,653 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 13:06:30,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:30,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:30,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,655 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:30,655 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:30,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,656 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 13:06:30,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,658 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 13:06:30,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,659 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 13:06:30,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:30,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:30,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,661 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 13:06:30,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,662 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 13:06:30,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,664 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 13:06:30,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:30,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,666 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 13:06:30,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,667 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,668 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 13:06:30,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,669 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:30,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:30,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:30,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:30,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,674 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 13:06:30,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:30,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,676 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 13:06:30,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:30,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,679 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 13:06:30,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:30,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:30,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,682 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 13:06:30,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,683 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 13:06:30,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:30,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:30,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,685 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 13:06:30,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,687 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 13:06:30,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,688 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 13:06:30,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,689 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 13:06:30,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:30,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:30,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:30,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,693 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 13:06:30,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,694 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 13:06:30,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,696 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 13:06:30,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,697 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 13:06:30,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,699 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 13:06:30,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:30,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:30,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,703 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 13:06:30,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:30,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:30,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,705 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 13:06:30,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,707 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 13:06:30,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:30,708 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:30,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,709 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 13:06:30,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,709 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-11-23 13:06:30,709 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 13:06:30,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,715 INFO L402 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2018-11-23 13:06:30,716 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-23 13:06:30,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,748 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 13:06:30,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:30,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:30,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,750 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 13:06:30,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:30,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:30,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,752 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 13:06:30,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,753 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:30,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,754 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:30,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:30,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,758 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 13:06:30,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:30,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:30,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:30,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:30,760 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 13:06:30,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:30,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:30,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:30,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:30,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:30,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:30,778 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:06:30,788 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:06:30,788 INFO L444 ModelExtractionUtils]: 51 out of 55 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:06:30,789 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:06:30,789 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:06:30,789 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:06:30,790 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strspn_~a~0.offset, v_rep(select #length ULTIMATE.start_strspn_~a~0.base)_3) = -1*ULTIMATE.start_strspn_~a~0.offset + 1*v_rep(select #length ULTIMATE.start_strspn_~a~0.base)_3 Supporting invariants [] [2018-11-23 13:06:30,963 INFO L297 tatePredicateManager]: 33 out of 33 supporting invariants were superfluous and have been removed [2018-11-23 13:06:30,964 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 13:06:30,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:30,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:30,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:30,992 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 13:06:30,993 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:06:30,993 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22 Second operand 3 states. [2018-11-23 13:06:31,015 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22. Second operand 3 states. Result 116 states and 147 transitions. Complement of second has 5 states. [2018-11-23 13:06:31,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:31,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:06:31,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-23 13:06:31,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-23 13:06:31,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:31,024 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:06:31,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:31,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:31,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:31,061 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 13:06:31,061 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:06:31,061 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22 Second operand 3 states. [2018-11-23 13:06:31,074 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22. Second operand 3 states. Result 116 states and 147 transitions. Complement of second has 5 states. [2018-11-23 13:06:31,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:31,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:06:31,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-23 13:06:31,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-23 13:06:31,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:31,074 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:06:31,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:31,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:31,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:31,109 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 13:06:31,109 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:06:31,109 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22 Second operand 3 states. [2018-11-23 13:06:31,126 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 72 transitions. cyclomatic complexity: 22. Second operand 3 states. Result 99 states and 130 transitions. Complement of second has 4 states. [2018-11-23 13:06:31,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:31,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:06:31,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-23 13:06:31,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-23 13:06:31,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:31,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 20 letters. Loop has 4 letters. [2018-11-23 13:06:31,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:31,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 56 transitions. Stem has 16 letters. Loop has 8 letters. [2018-11-23 13:06:31,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:31,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 130 transitions. [2018-11-23 13:06:31,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:06:31,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 61 states and 79 transitions. [2018-11-23 13:06:31,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-23 13:06:31,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-23 13:06:31,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 79 transitions. [2018-11-23 13:06:31,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:31,131 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 79 transitions. [2018-11-23 13:06:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 79 transitions. [2018-11-23 13:06:31,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 46. [2018-11-23 13:06:31,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 13:06:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2018-11-23 13:06:31,133 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-11-23 13:06:31,133 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-11-23 13:06:31,133 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 13:06:31,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 58 transitions. [2018-11-23 13:06:31,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:06:31,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:31,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:31,134 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:31,134 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:06:31,134 INFO L794 eck$LassoCheckResult]: Stem: 1993#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1963#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 1962#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 1953#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 1954#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 1964#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 1971#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 1967#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 1968#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 1980#L511-1 assume !strspn_#t~short7; 1991#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 1983#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 1984#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 1955#L510-5 strspn_#res := strspn_~l~0; 1956#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 1977#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 1972#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 1974#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 1989#L524-4 [2018-11-23 13:06:31,134 INFO L796 eck$LassoCheckResult]: Loop: 1989#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1957#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 1958#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 1987#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 1989#L524-4 [2018-11-23 13:06:31,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:31,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1811163636, now seen corresponding path program 1 times [2018-11-23 13:06:31,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:31,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:31,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:31,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:31,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:31,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:31,153 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 1 times [2018-11-23 13:06:31,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:31,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:31,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:31,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:31,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:31,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:31,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1593747347, now seen corresponding path program 1 times [2018-11-23 13:06:31,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:31,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:31,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:31,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:31,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:31,316 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 13:06:31,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:06:31,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 13:06:31,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:06:31,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:06:31,342 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. cyclomatic complexity: 16 Second operand 10 states. [2018-11-23 13:06:31,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:31,467 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2018-11-23 13:06:31,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:06:31,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 119 transitions. [2018-11-23 13:06:31,469 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 13:06:31,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 78 states and 97 transitions. [2018-11-23 13:06:31,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-23 13:06:31,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2018-11-23 13:06:31,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 97 transitions. [2018-11-23 13:06:31,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:31,470 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 97 transitions. [2018-11-23 13:06:31,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 97 transitions. [2018-11-23 13:06:31,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 46. [2018-11-23 13:06:31,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 13:06:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2018-11-23 13:06:31,472 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2018-11-23 13:06:31,472 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2018-11-23 13:06:31,472 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 13:06:31,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 57 transitions. [2018-11-23 13:06:31,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:06:31,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:31,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:31,473 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:31,473 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:06:31,474 INFO L794 eck$LassoCheckResult]: Stem: 2163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2133#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 2132#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 2123#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 2124#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2134#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 2141#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2139#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 2140#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2151#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 2168#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 2154#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 2155#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 2145#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 2146#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2148#L510-1 assume !(0 != strspn_#t~mem10);havoc strspn_#t~mem10; 2125#L510-5 strspn_#res := strspn_~l~0; 2126#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 2147#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 2142#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2144#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 2158#L524-4 [2018-11-23 13:06:31,474 INFO L796 eck$LassoCheckResult]: Loop: 2158#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2127#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2128#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 2156#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 2158#L524-4 [2018-11-23 13:06:31,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:31,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1960799173, now seen corresponding path program 1 times [2018-11-23 13:06:31,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:31,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:31,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:31,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:31,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:31,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:31,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:31,642 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a134afb-d0a0-40ed-9846-152b31692f37/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:31,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:31,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:31,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 13:06:31,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:31,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-23 13:06:31,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-23 13:06:31,733 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:31,736 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:31,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:06:31,745 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:23, output treesize:14 [2018-11-23 13:06:31,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 13:06:31,983 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:06:31,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 13:06:31,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:31,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:31,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:31,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:3 [2018-11-23 13:06:32,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:32,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:32,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2018-11-23 13:06:32,023 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:06:32,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:32,023 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 2 times [2018-11-23 13:06:32,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:32,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:32,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:32,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:32,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:32,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 13:06:32,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2018-11-23 13:06:32,072 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. cyclomatic complexity: 15 Second operand 22 states. [2018-11-23 13:06:34,504 WARN L180 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2018-11-23 13:06:34,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:34,584 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2018-11-23 13:06:34,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:06:34,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 114 transitions. [2018-11-23 13:06:34,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:06:34,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 89 states and 111 transitions. [2018-11-23 13:06:34,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-23 13:06:34,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-23 13:06:34,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 111 transitions. [2018-11-23 13:06:34,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:34,586 INFO L705 BuchiCegarLoop]: Abstraction has 89 states and 111 transitions. [2018-11-23 13:06:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 111 transitions. [2018-11-23 13:06:34,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 57. [2018-11-23 13:06:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 13:06:34,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2018-11-23 13:06:34,588 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 71 transitions. [2018-11-23 13:06:34,588 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 71 transitions. [2018-11-23 13:06:34,588 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 13:06:34,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 71 transitions. [2018-11-23 13:06:34,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:06:34,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:34,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:34,589 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:34,589 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:06:34,590 INFO L794 eck$LassoCheckResult]: Stem: 2404#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2372#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 2371#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 2362#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 2363#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2373#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 2380#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2376#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 2377#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2389#L511-1 assume !strspn_#t~short7; 2403#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 2405#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 2390#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2391#L511-1 assume !strspn_#t~short7; 2402#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 2392#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 2393#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 2364#L510-5 strspn_#res := strspn_~l~0; 2365#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 2386#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 2381#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2382#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 2400#L524-4 [2018-11-23 13:06:34,590 INFO L796 eck$LassoCheckResult]: Loop: 2400#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2366#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2367#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 2396#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 2400#L524-4 [2018-11-23 13:06:34,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:34,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1052721677, now seen corresponding path program 1 times [2018-11-23 13:06:34,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:34,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:34,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:34,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:34,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:34,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:34,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:06:34,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:06:34,612 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:06:34,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:34,612 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 3 times [2018-11-23 13:06:34,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:34,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:34,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:34,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:34,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:34,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:06:34,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:06:34,661 INFO L87 Difference]: Start difference. First operand 57 states and 71 transitions. cyclomatic complexity: 19 Second operand 3 states. [2018-11-23 13:06:34,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:34,665 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-11-23 13:06:34,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:06:34,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 72 transitions. [2018-11-23 13:06:34,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:06:34,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 58 states and 69 transitions. [2018-11-23 13:06:34,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-23 13:06:34,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 13:06:34,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 69 transitions. [2018-11-23 13:06:34,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:34,668 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-11-23 13:06:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 69 transitions. [2018-11-23 13:06:34,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-23 13:06:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 13:06:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-11-23 13:06:34,670 INFO L728 BuchiCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-11-23 13:06:34,670 INFO L608 BuchiCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-11-23 13:06:34,670 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 13:06:34,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 68 transitions. [2018-11-23 13:06:34,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:06:34,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:34,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:34,673 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:34,674 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:06:34,674 INFO L794 eck$LassoCheckResult]: Stem: 2528#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2496#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 2495#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 2486#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 2487#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2497#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 2504#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2500#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 2501#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2513#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 2534#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 2533#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 2532#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2525#L511-1 assume !strspn_#t~short7; 2526#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 2516#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 2517#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 2488#L510-5 strspn_#res := strspn_~l~0; 2489#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 2510#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 2505#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2506#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 2523#L524-4 [2018-11-23 13:06:34,674 INFO L796 eck$LassoCheckResult]: Loop: 2523#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2490#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2491#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 2520#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 2523#L524-4 [2018-11-23 13:06:34,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:34,674 INFO L82 PathProgramCache]: Analyzing trace with hash -465915663, now seen corresponding path program 1 times [2018-11-23 13:06:34,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:34,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:34,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:34,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:34,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:34,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:34,699 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 4 times [2018-11-23 13:06:34,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:34,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:34,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:34,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:34,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:34,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:34,707 INFO L82 PathProgramCache]: Analyzing trace with hash -187987976, now seen corresponding path program 1 times [2018-11-23 13:06:34,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:34,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:34,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:34,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:34,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:35,622 WARN L180 SmtUtils]: Spent 815.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 223 [2018-11-23 13:06:35,825 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2018-11-23 13:06:35,827 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:06:35,827 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:06:35,827 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:06:35,827 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:06:35,827 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:06:35,827 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:06:35,827 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:06:35,827 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:06:35,827 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration12_Lasso [2018-11-23 13:06:35,827 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:06:35,827 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:06:35,830 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 13:06:35,831 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 13:06:35,832 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 13:06:35,833 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 13:06:35,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:35,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:35,835 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 13:06:35,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:35,838 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 13:06:35,839 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 13:06:35,840 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 13:06:35,841 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 13:06:35,841 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 13:06:35,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:35,843 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 13:06:35,844 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 13:06:35,845 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 13:06:35,846 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 13:06:35,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:35,848 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 13:06:35,848 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 13:06:35,849 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 13:06:35,850 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 13:06:35,851 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 13:06:35,851 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 13:06:35,852 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 13:06:35,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:35,856 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 13:06:35,857 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 13:06:35,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:35,861 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 13:06:35,862 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 13:06:35,863 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 13:06:35,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:36,404 WARN L180 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 153 [2018-11-23 13:06:36,485 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 13:06:36,486 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 13:06:36,487 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 13:06:36,488 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 13:06:36,488 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 13:06:36,826 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2018-11-23 13:06:37,121 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-23 13:06:37,240 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:06:37,240 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:06:37,240 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 13:06:37,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,246 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 13:06:37,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,248 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 13:06:37,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,249 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 13:06:37,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,250 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 13:06:37,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,251 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 13:06:37,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,252 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 13:06:37,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,254 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 13:06:37,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,255 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 13:06:37,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,256 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 13:06:37,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,257 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 13:06:37,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,259 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 13:06:37,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,260 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 13:06:37,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,261 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 13:06:37,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,262 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 13:06:37,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,263 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:37,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:37,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,264 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 13:06:37,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:37,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:37,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,266 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 13:06:37,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,267 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 13:06:37,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,269 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 13:06:37,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,270 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 13:06:37,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,271 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 13:06:37,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,273 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 13:06:37,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,274 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 13:06:37,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,275 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 13:06:37,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,276 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,276 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 13:06:37,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,278 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 13:06:37,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,279 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 13:06:37,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,280 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 13:06:37,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,281 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 13:06:37,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,283 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 13:06:37,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,284 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 13:06:37,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,285 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 13:06:37,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,287 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 13:06:37,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,288 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 13:06:37,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,289 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 13:06:37,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:37,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:37,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:37,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,290 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 13:06:37,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:37,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:37,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,293 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 13:06:37,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:37,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:37,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,295 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 13:06:37,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,295 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:37,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,296 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:37,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:37,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,302 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 13:06:37,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,303 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:37,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,304 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:37,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:37,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,310 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 13:06:37,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:37,311 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:37,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,311 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 13:06:37,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:37,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:37,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,315 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 13:06:37,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:37,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:37,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,317 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 13:06:37,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:37,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:37,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,319 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 13:06:37,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,320 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:37,320 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:37,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,321 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 13:06:37,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,321 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:37,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,322 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:37,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:37,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,324 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 13:06:37,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:37,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:37,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,326 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 13:06:37,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:37,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:37,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,329 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 13:06:37,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:37,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:37,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,331 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 13:06:37,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,332 INFO L205 nArgumentSynthesizer]: 6 stem disjuncts [2018-11-23 13:06:37,332 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-23 13:06:37,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,341 INFO L402 nArgumentSynthesizer]: We have 88 Motzkin's Theorem applications. [2018-11-23 13:06:37,341 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-23 13:06:37,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,382 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 13:06:37,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:37,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:37,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:37,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:37,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:37,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:37,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:37,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:37,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:37,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:37,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:37,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:37,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:37,409 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:06:37,423 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:06:37,424 INFO L444 ModelExtractionUtils]: 77 out of 82 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:06:37,424 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:06:37,424 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:06:37,425 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:06:37,425 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_2, ULTIMATE.start_strcspn_~reject.offset) = -1*ULTIMATE.start_strcspn_~i~0 + 1*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_2 - 1*ULTIMATE.start_strcspn_~reject.offset Supporting invariants [] [2018-11-23 13:06:37,741 INFO L297 tatePredicateManager]: 56 out of 56 supporting invariants were superfluous and have been removed [2018-11-23 13:06:37,742 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 13:06:37,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:37,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:37,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:37,793 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 13:06:37,793 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:06:37,794 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 68 transitions. cyclomatic complexity: 16 Second operand 3 states. [2018-11-23 13:06:37,807 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 68 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 84 states and 98 transitions. Complement of second has 5 states. [2018-11-23 13:06:37,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:37,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:06:37,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-23 13:06:37,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 22 letters. Loop has 4 letters. [2018-11-23 13:06:37,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:37,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 26 letters. Loop has 4 letters. [2018-11-23 13:06:37,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:37,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 22 letters. Loop has 8 letters. [2018-11-23 13:06:37,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:37,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 98 transitions. [2018-11-23 13:06:37,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:06:37,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 68 states and 80 transitions. [2018-11-23 13:06:37,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-23 13:06:37,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-23 13:06:37,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 80 transitions. [2018-11-23 13:06:37,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:37,809 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 80 transitions. [2018-11-23 13:06:37,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 80 transitions. [2018-11-23 13:06:37,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2018-11-23 13:06:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 13:06:37,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2018-11-23 13:06:37,810 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-11-23 13:06:37,810 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-11-23 13:06:37,810 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 13:06:37,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 74 transitions. [2018-11-23 13:06:37,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:06:37,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:37,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:37,811 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:37,811 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:06:37,811 INFO L794 eck$LassoCheckResult]: Stem: 2996#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2959#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 2958#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 2950#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 2951#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 2960#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 2967#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 2963#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 2964#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2978#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 3002#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 3001#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 3000#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 2992#L511-1 assume !strspn_#t~short7; 2993#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 2982#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 2983#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 2952#L510-5 strspn_#res := strspn_~l~0; 2953#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 2974#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 2968#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2969#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 3009#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3003#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 2998#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 2961#L523-3 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 2962#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 2970#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 2990#L524-4 [2018-11-23 13:06:37,811 INFO L796 eck$LassoCheckResult]: Loop: 2990#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2954#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 2955#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 2986#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 2990#L524-4 [2018-11-23 13:06:37,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:37,811 INFO L82 PathProgramCache]: Analyzing trace with hash -269478821, now seen corresponding path program 1 times [2018-11-23 13:06:37,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:37,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:37,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:37,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:37,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:37,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:06:37,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:37,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a134afb-d0a0-40ed-9846-152b31692f37/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:37,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:37,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:38,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-23 13:06:38,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-23 13:06:38,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:38,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:38,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:38,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-11-23 13:06:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:06:38,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:38,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-11-23 13:06:38,092 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:06:38,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:38,092 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 5 times [2018-11-23 13:06:38,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:38,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:38,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:38,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:38,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:38,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:06:38,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:06:38,134 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. cyclomatic complexity: 17 Second operand 17 states. [2018-11-23 13:06:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:38,397 INFO L93 Difference]: Finished difference Result 142 states and 161 transitions. [2018-11-23 13:06:38,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:06:38,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 161 transitions. [2018-11-23 13:06:38,398 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 13:06:38,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 140 states and 159 transitions. [2018-11-23 13:06:38,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-23 13:06:38,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-23 13:06:38,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 159 transitions. [2018-11-23 13:06:38,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:38,401 INFO L705 BuchiCegarLoop]: Abstraction has 140 states and 159 transitions. [2018-11-23 13:06:38,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 159 transitions. [2018-11-23 13:06:38,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 66. [2018-11-23 13:06:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 13:06:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 77 transitions. [2018-11-23 13:06:38,404 INFO L728 BuchiCegarLoop]: Abstraction has 66 states and 77 transitions. [2018-11-23 13:06:38,404 INFO L608 BuchiCegarLoop]: Abstraction has 66 states and 77 transitions. [2018-11-23 13:06:38,404 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 13:06:38,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 77 transitions. [2018-11-23 13:06:38,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:06:38,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:38,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:38,406 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:38,406 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:06:38,406 INFO L794 eck$LassoCheckResult]: Stem: 3322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3289#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 3288#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 3280#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 3281#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 3290#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 3297#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 3293#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 3294#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 3306#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 3329#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 3328#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 3327#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 3319#L511-1 assume !strspn_#t~short7; 3320#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 3310#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 3311#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 3282#L510-5 strspn_#res := strspn_~l~0; 3283#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 3304#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 3298#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 3299#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 3323#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3286#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3287#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 3315#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 3318#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3330#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 3324#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 3291#L523-3 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 3292#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 3300#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 3316#L524-4 [2018-11-23 13:06:38,406 INFO L796 eck$LassoCheckResult]: Loop: 3316#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3284#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 3285#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 3314#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 3316#L524-4 [2018-11-23 13:06:38,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:38,406 INFO L82 PathProgramCache]: Analyzing trace with hash 579815970, now seen corresponding path program 1 times [2018-11-23 13:06:38,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:38,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:38,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:38,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:38,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:38,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:38,428 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 6 times [2018-11-23 13:06:38,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:38,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:38,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:38,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:38,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:38,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:38,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1474175145, now seen corresponding path program 2 times [2018-11-23 13:06:38,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:38,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:38,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:38,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:38,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:39,398 WARN L180 SmtUtils]: Spent 898.00 ms on a formula simplification. DAG size of input: 327 DAG size of output: 253 [2018-11-23 13:06:39,585 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2018-11-23 13:06:39,587 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:06:39,587 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:06:39,587 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:06:39,587 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:06:39,587 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:06:39,587 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:06:39,587 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:06:39,588 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:06:39,588 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration14_Lasso [2018-11-23 13:06:39,588 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:06:39,588 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:06:39,591 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 13:06:39,600 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 13:06:39,601 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 13:06:39,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:39,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:39,609 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 13:06:39,611 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 13:06:39,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:39,613 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 13:06:39,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:39,615 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 13:06:39,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:39,617 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 13:06:40,173 WARN L180 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 157 [2018-11-23 13:06:40,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:40,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:40,249 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 13:06:40,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:40,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:40,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:40,261 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 13:06:40,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:40,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:40,264 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 13:06:40,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:40,266 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 13:06:40,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:40,268 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 13:06:40,269 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 13:06:40,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:40,271 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 13:06:40,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:40,273 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 13:06:40,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:40,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:40,275 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 13:06:40,276 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 13:06:40,276 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 13:06:40,277 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 13:06:40,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:40,455 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-23 13:06:40,711 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2018-11-23 13:06:41,029 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2018-11-23 13:06:41,063 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:06:41,063 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:06:41,064 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 13:06:41,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:41,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:41,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:41,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:41,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:41,064 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:41,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:41,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:41,065 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 13:06:41,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:41,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:41,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:41,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:41,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:41,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:41,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:41,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:41,066 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 13:06:41,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:41,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:41,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:41,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:41,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:41,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:41,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:41,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:41,067 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 13:06:41,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:41,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:41,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:41,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:41,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:41,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:41,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:41,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:41,068 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 13:06:41,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:41,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:41,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:41,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:41,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:41,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:41,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:41,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:41,070 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 13:06:41,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:41,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:41,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:41,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:41,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:41,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:41,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:41,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:41,071 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 13:06:41,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:41,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:41,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:41,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:41,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:41,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:41,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:41,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:41,072 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 13:06:41,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:41,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:41,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:41,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:41,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:41,073 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:41,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:41,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:41,073 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 13:06:41,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:41,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:41,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:41,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:41,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:41,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:41,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:41,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:41,074 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 13:06:41,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:41,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:41,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:41,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:41,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:41,075 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:41,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:41,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:41,075 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 13:06:41,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:41,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:41,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:41,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:41,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:41,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:41,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:41,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:41,077 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 13:06:41,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:41,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:41,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:41,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:41,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:41,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:41,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:41,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:41,078 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 13:06:41,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:41,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:41,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:41,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:41,079 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:41,079 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:41,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:41,084 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 13:06:41,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:41,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:41,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:41,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:41,084 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:41,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:41,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:41,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:41,085 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 13:06:41,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:41,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:41,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:41,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:41,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:41,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:41,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:41,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:41,086 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 13:06:41,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:41,087 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:41,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:41,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:41,087 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:41,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:41,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:41,089 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 13:06:41,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:41,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:41,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:41,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:41,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:41,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:41,135 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:06:41,186 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-23 13:06:41,186 INFO L444 ModelExtractionUtils]: 79 out of 88 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-23 13:06:41,186 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:06:41,187 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:06:41,187 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:06:41,187 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_3) = -2*ULTIMATE.start_strcspn_~i~0 + 3*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_3 Supporting invariants [] [2018-11-23 13:06:41,394 INFO L297 tatePredicateManager]: 45 out of 46 supporting invariants were superfluous and have been removed [2018-11-23 13:06:41,395 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 13:06:41,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:41,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:41,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:41,509 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 13:06:41,509 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 3 loop predicates [2018-11-23 13:06:41,509 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17 Second operand 10 states. [2018-11-23 13:06:41,593 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17. Second operand 10 states. Result 81 states and 94 transitions. Complement of second has 8 states. [2018-11-23 13:06:41,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 6 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:06:41,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-11-23 13:06:41,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 32 letters. Loop has 4 letters. [2018-11-23 13:06:41,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:41,594 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:06:41,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:41,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:41,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:41,720 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 13:06:41,720 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.7 stem predicates 3 loop predicates [2018-11-23 13:06:41,720 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17 Second operand 10 states. [2018-11-23 13:06:41,821 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17. Second operand 10 states. Result 81 states and 94 transitions. Complement of second has 8 states. [2018-11-23 13:06:41,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 6 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:06:41,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-11-23 13:06:41,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 40 transitions. Stem has 32 letters. Loop has 4 letters. [2018-11-23 13:06:41,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:41,822 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:06:41,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:41,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:41,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:41,957 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 13:06:41,958 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.7 stem predicates 3 loop predicates [2018-11-23 13:06:41,958 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17 Second operand 10 states. [2018-11-23 13:06:42,127 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 77 transitions. cyclomatic complexity: 17. Second operand 10 states. Result 133 states and 153 transitions. Complement of second has 15 states. [2018-11-23 13:06:42,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2018-11-23 13:06:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:06:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2018-11-23 13:06:42,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 82 transitions. Stem has 32 letters. Loop has 4 letters. [2018-11-23 13:06:42,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:42,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 82 transitions. Stem has 36 letters. Loop has 4 letters. [2018-11-23 13:06:42,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:42,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 82 transitions. Stem has 32 letters. Loop has 8 letters. [2018-11-23 13:06:42,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:42,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 153 transitions. [2018-11-23 13:06:42,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 13:06:42,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 119 states and 136 transitions. [2018-11-23 13:06:42,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-23 13:06:42,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2018-11-23 13:06:42,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 136 transitions. [2018-11-23 13:06:42,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:42,131 INFO L705 BuchiCegarLoop]: Abstraction has 119 states and 136 transitions. [2018-11-23 13:06:42,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 136 transitions. [2018-11-23 13:06:42,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2018-11-23 13:06:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 13:06:42,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2018-11-23 13:06:42,134 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2018-11-23 13:06:42,134 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 104 transitions. [2018-11-23 13:06:42,134 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 13:06:42,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 104 transitions. [2018-11-23 13:06:42,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:06:42,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:42,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:42,135 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:42,135 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:06:42,135 INFO L794 eck$LassoCheckResult]: Stem: 4302#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4270#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 4268#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 4260#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 4261#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 4269#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 4277#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4284#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 4325#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4324#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 4322#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 4320#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 4319#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 4316#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 4285#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4275#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 4276#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4287#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 4312#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 4291#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 4292#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 4280#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 4281#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4313#L510-1 assume !(0 != strspn_#t~mem10);havoc strspn_#t~mem10; 4262#L510-5 strspn_#res := strspn_~l~0; 4263#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 4282#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 4278#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 4279#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4297#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4303#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4348#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 4347#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 4346#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4344#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 4304#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 4305#L523-3 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 4310#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 4295#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4296#L524-4 [2018-11-23 13:06:42,135 INFO L796 eck$LassoCheckResult]: Loop: 4296#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4264#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4265#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 4293#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 4296#L524-4 [2018-11-23 13:06:42,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:42,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1481576100, now seen corresponding path program 1 times [2018-11-23 13:06:42,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:42,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:42,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:42,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:42,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:42,335 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:06:42,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:06:42,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3a134afb-d0a0-40ed-9846-152b31692f37/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:06:42,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:42,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:42,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-11-23 13:06:42,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-23 13:06:42,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:42,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:42,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:06:42,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-11-23 13:06:44,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 13:06:44,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 13:06:44,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:06:44,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:44,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:06:44,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 13:06:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:06:44,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:06:44,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 25 [2018-11-23 13:06:44,212 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:06:44,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:44,212 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 7 times [2018-11-23 13:06:44,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:44,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:44,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:44,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:44,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:44,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:06:44,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=535, Unknown=1, NotChecked=0, Total=600 [2018-11-23 13:06:44,242 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. cyclomatic complexity: 22 Second operand 25 states. [2018-11-23 13:06:44,800 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-23 13:06:44,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:06:44,894 INFO L93 Difference]: Finished difference Result 138 states and 159 transitions. [2018-11-23 13:06:44,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:06:44,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 159 transitions. [2018-11-23 13:06:44,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:06:44,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 133 states and 154 transitions. [2018-11-23 13:06:44,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-11-23 13:06:44,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-23 13:06:44,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 133 states and 154 transitions. [2018-11-23 13:06:44,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:06:44,896 INFO L705 BuchiCegarLoop]: Abstraction has 133 states and 154 transitions. [2018-11-23 13:06:44,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states and 154 transitions. [2018-11-23 13:06:44,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 101. [2018-11-23 13:06:44,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-23 13:06:44,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2018-11-23 13:06:44,898 INFO L728 BuchiCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-11-23 13:06:44,898 INFO L608 BuchiCegarLoop]: Abstraction has 101 states and 117 transitions. [2018-11-23 13:06:44,898 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-23 13:06:44,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 117 transitions. [2018-11-23 13:06:44,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:06:44,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:06:44,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:06:44,900 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:06:44,900 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 13:06:44,900 INFO L794 eck$LassoCheckResult]: Stem: 4701#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4664#L-1 havoc main_#res;havoc main_#t~nondet24, main_#t~malloc25.base, main_#t~malloc25.offset, main_#t~nondet26, main_#t~malloc27.base, main_#t~malloc27.offset, main_#t~ret28.base, main_#t~ret28.offset, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~delim_len~0, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;main_~in_len~0 := main_#t~nondet24;havoc main_#t~nondet24; 4663#L544 assume !(main_~in_len~0 < 1);call main_#t~malloc25.base, main_#t~malloc25.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc25.base, main_#t~malloc25.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~delim_len~0 := main_#t~nondet26;havoc main_#t~nondet26; 4655#L548 assume !(main_~delim_len~0 < 1);call main_#t~malloc27.base, main_#t~malloc27.offset := #Ultimate.alloc(main_~delim_len~0);main_~delim~0.base, main_~delim~0.offset := main_#t~malloc27.base, main_#t~malloc27.offset;call main_~#ptr~0.base, main_~#ptr~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, main_~#ptr~0.base, main_~#ptr~0.offset, 8);strtok_r_#in~s.base, strtok_r_#in~s.offset, strtok_r_#in~delim.base, strtok_r_#in~delim.offset, strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset := main_~in~0.base, main_~in~0.offset, main_~delim~0.base, main_~delim~0.offset, main_~#ptr~0.base, main_~#ptr~0.offset;havoc strtok_r_#res.base, strtok_r_#res.offset;havoc strtok_r_#t~mem18.base, strtok_r_#t~mem18.offset, strtok_r_#t~ret19, strtok_r_#t~mem20, strtok_r_#t~ret21, strtok_r_#t~mem22, strtok_r_#t~post23.base, strtok_r_#t~post23.offset, strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset, strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset, strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_#in~s.base, strtok_r_#in~s.offset;strtok_r_~delim.base, strtok_r_~delim.offset := strtok_r_#in~delim.base, strtok_r_#in~delim.offset;strtok_r_~ptrptr.base, strtok_r_~ptrptr.offset := strtok_r_#in~ptrptr.base, strtok_r_#in~ptrptr.offset;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := 0, 0; 4656#L532 assume !(strtok_r_~s.base == 0 && strtok_r_~s.offset == 0); 4665#L532-2 strspn_#in~s.base, strspn_#in~s.offset, strspn_#in~accept.base, strspn_#in~accept.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strspn_#res;havoc strspn_#t~post3.base, strspn_#t~post3.offset, strspn_#t~mem6, strspn_#t~mem4, strspn_#t~mem5, strspn_#t~short7, strspn_#t~mem8, strspn_#t~post9, strspn_#t~post2.base, strspn_#t~post2.offset, strspn_#t~mem10, strspn_~s.base, strspn_~s.offset, strspn_~accept.base, strspn_~accept.offset, strspn_~l~0, strspn_~a~0.base, strspn_~a~0.offset;strspn_~s.base, strspn_~s.offset := strspn_#in~s.base, strspn_#in~s.offset;strspn_~accept.base, strspn_~accept.offset := strspn_#in~accept.base, strspn_#in~accept.offset;strspn_~l~0 := 0;havoc strspn_~a~0.base, strspn_~a~0.offset; 4672#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4680#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 4751#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4750#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 4749#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 4748#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 4746#L512 assume !(0 == strspn_#t~mem8);havoc strspn_#t~mem8;strspn_#t~post9 := strspn_~l~0;strspn_~l~0 := 1 + strspn_#t~post9;havoc strspn_#t~post9; 4745#L510-3 strspn_#t~post2.base, strspn_#t~post2.offset := strspn_~s.base, strspn_~s.offset;strspn_~s.base, strspn_~s.offset := strspn_#t~post2.base, 1 + strspn_#t~post2.offset;havoc strspn_#t~post2.base, strspn_#t~post2.offset; 4681#L510-4 call strspn_#t~mem10 := read~int(strspn_~s.base, strspn_~s.offset, 1); 4668#L510-1 assume !!(0 != strspn_#t~mem10);havoc strspn_#t~mem10;strspn_~a~0.base, strspn_~a~0.offset := strspn_~accept.base, strspn_~accept.offset; 4669#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4682#L511-1 assume strspn_#t~short7;call strspn_#t~mem4 := read~int(strspn_~s.base, strspn_~s.offset, 1);call strspn_#t~mem5 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := strspn_#t~mem4 != strspn_#t~mem5; 4733#L511-3 assume !!strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 4732#L511-5 strspn_#t~post3.base, strspn_#t~post3.offset := strspn_~a~0.base, strspn_~a~0.offset;strspn_~a~0.base, strspn_~a~0.offset := strspn_#t~post3.base, 1 + strspn_#t~post3.offset;havoc strspn_#t~post3.base, strspn_#t~post3.offset; 4731#L511-6 call strspn_#t~mem6 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1);strspn_#t~short7 := 0 != strspn_#t~mem6; 4698#L511-1 assume !strspn_#t~short7; 4699#L511-3 assume !strspn_#t~short7;havoc strspn_#t~mem6;havoc strspn_#t~mem4;havoc strspn_#t~short7;havoc strspn_#t~mem5; 4685#L511-7 call strspn_#t~mem8 := read~int(strspn_~a~0.base, strspn_~a~0.offset, 1); 4686#L512 assume 0 == strspn_#t~mem8;havoc strspn_#t~mem8; 4657#L510-5 strspn_#res := strspn_~l~0; 4658#L517 strtok_r_#t~ret19 := strspn_#res;strtok_r_~s.base, strtok_r_~s.offset := strtok_r_~s.base, strtok_r_~s.offset + strtok_r_#t~ret19 % 4294967296;havoc strtok_r_#t~ret19;call strtok_r_#t~mem20 := read~int(strtok_r_~s.base, strtok_r_~s.offset, 1); 4692#L534 assume 0 != strtok_r_#t~mem20;havoc strtok_r_#t~mem20;strtok_r_~tmp~0.base, strtok_r_~tmp~0.offset := strtok_r_~s.base, strtok_r_~s.offset;strcspn_#in~s.base, strcspn_#in~s.offset, strcspn_#in~reject.base, strcspn_#in~reject.offset := strtok_r_~s.base, strtok_r_~s.offset, strtok_r_~delim.base, strtok_r_~delim.offset;havoc strcspn_#res;havoc strcspn_#t~mem13, strcspn_#t~mem14, strcspn_#t~pre12, strcspn_#t~mem15, strcspn_#t~pre16, strcspn_#t~pre11.base, strcspn_#t~pre11.offset, strcspn_#t~mem17, strcspn_~s.base, strcspn_~s.offset, strcspn_~reject.base, strcspn_~reject.offset, strcspn_~l~1, strcspn_~i~0;strcspn_~s.base, strcspn_~s.offset := strcspn_#in~s.base, strcspn_#in~s.offset;strcspn_~reject.base, strcspn_~reject.offset := strcspn_#in~reject.base, strcspn_#in~reject.offset;strcspn_~l~1 := 0;havoc strcspn_~i~0; 4673#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 4674#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4695#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4661#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4662#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 4696#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 4697#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4708#L524-1 assume !(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15; 4702#L524-5 strcspn_#t~pre16 := 1 + strcspn_~l~1;strcspn_~l~1 := 1 + strcspn_~l~1;havoc strcspn_#t~pre16; 4703#L523-3 strcspn_#t~pre11.base, strcspn_#t~pre11.offset := strcspn_~s.base, 1 + strcspn_~s.offset;strcspn_~s.base, strcspn_~s.offset := strcspn_~s.base, 1 + strcspn_~s.offset;havoc strcspn_#t~pre11.base, strcspn_#t~pre11.offset; 4705#L523-4 call strcspn_#t~mem17 := read~int(strcspn_~s.base, strcspn_~s.offset, 1); 4693#L523-1 assume !!(0 != strcspn_#t~mem17);havoc strcspn_#t~mem17;strcspn_~i~0 := 0; 4694#L524-4 [2018-11-23 13:06:44,900 INFO L796 eck$LassoCheckResult]: Loop: 4694#L524-4 call strcspn_#t~mem15 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4659#L524-1 assume !!(0 != strcspn_#t~mem15);havoc strcspn_#t~mem15;call strcspn_#t~mem13 := read~int(strcspn_~s.base, strcspn_~s.offset, 1);call strcspn_#t~mem14 := read~int(strcspn_~reject.base, strcspn_~reject.offset + strcspn_~i~0, 1); 4660#L525 assume !(strcspn_#t~mem13 == strcspn_#t~mem14);havoc strcspn_#t~mem13;havoc strcspn_#t~mem14; 4689#L524-3 strcspn_#t~pre12 := 1 + strcspn_~i~0;strcspn_~i~0 := 1 + strcspn_~i~0;havoc strcspn_#t~pre12; 4694#L524-4 [2018-11-23 13:06:44,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:44,900 INFO L82 PathProgramCache]: Analyzing trace with hash -760734412, now seen corresponding path program 1 times [2018-11-23 13:06:44,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:44,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:44,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:44,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:44,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:44,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:44,922 INFO L82 PathProgramCache]: Analyzing trace with hash 3329800, now seen corresponding path program 8 times [2018-11-23 13:06:44,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:44,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:44,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:44,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:06:44,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:44,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:44,925 INFO L82 PathProgramCache]: Analyzing trace with hash -632087877, now seen corresponding path program 2 times [2018-11-23 13:06:44,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:06:44,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:06:44,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:44,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:06:44,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:06:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:46,162 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 382 DAG size of output: 280 [2018-11-23 13:06:46,369 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2018-11-23 13:06:46,371 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:06:46,371 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:06:46,371 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:06:46,371 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:06:46,371 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:06:46,371 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:06:46,371 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:06:46,371 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:06:46,371 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtok_r_true-termination.c.i_Iteration16_Lasso [2018-11-23 13:06:46,371 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:06:46,371 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:06:46,373 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 13:06:46,375 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 13:06:46,375 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 13:06:46,376 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 13:06:46,377 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 13:06:46,378 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 13:06:46,378 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 13:06:46,379 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 13:06:46,380 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 13:06:46,381 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 13:06:46,381 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 13:06:46,382 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 13:06:46,383 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 13:06:46,384 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 13:06:46,384 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 13:06:46,385 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 13:06:46,386 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 13:06:46,387 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 13:06:46,388 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 13:06:46,389 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 13:06:46,391 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 13:06:46,392 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 13:06:46,393 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 13:06:46,394 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 13:06:46,395 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 13:06:46,395 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 13:06:46,397 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 13:06:46,398 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 13:06:46,978 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 159 [2018-11-23 13:06:47,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:47,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:47,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:47,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:47,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:47,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:47,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:47,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:47,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:47,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:47,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:06:47,870 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-11-23 13:06:47,929 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:06:47,929 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:06:47,929 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 13:06:47,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,931 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 13:06:47,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,932 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 13:06:47,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,933 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 13:06:47,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,934 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,934 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 13:06:47,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:47,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:47,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,937 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,937 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 13:06:47,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,939 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 13:06:47,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,940 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 13:06:47,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,941 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 13:06:47,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,942 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 13:06:47,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,943 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 13:06:47,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,944 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,945 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 13:06:47,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,945 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,946 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 13:06:47,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:47,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,947 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,948 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 13:06:47,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,949 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 13:06:47,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,950 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,950 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 13:06:47,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:47,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:47,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:06:47,952 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,953 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 13:06:47,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,954 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 13:06:47,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,956 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 13:06:47,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,957 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 13:06:47,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,958 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 13:06:47,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,959 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 13:06:47,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:47,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:47,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,961 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 13:06:47,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:47,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:47,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,963 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 13:06:47,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:06:47,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:06:47,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:06:47,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,964 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 13:06:47,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,964 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 13:06:47,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,966 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 13:06:47,966 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:47,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:06:47,971 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 13:06:47,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:06:47,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:06:47,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:06:47,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:06:47,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 13:06:47,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 13:06:47,985 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:06:47,993 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:06:47,993 INFO L444 ModelExtractionUtils]: 71 out of 76 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:06:47,994 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:06:47,994 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 13:06:47,994 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:06:47,995 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strcspn_~i~0, ULTIMATE.start_strcspn_~reject.offset, v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4) = -1*ULTIMATE.start_strcspn_~i~0 - 1*ULTIMATE.start_strcspn_~reject.offset + 1*v_rep(select #length ULTIMATE.start_strcspn_~reject.base)_4 Supporting invariants [] [2018-11-23 13:06:48,508 INFO L297 tatePredicateManager]: 65 out of 65 supporting invariants were superfluous and have been removed [2018-11-23 13:06:48,509 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 13:06:48,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:48,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:48,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:48,558 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 13:06:48,558 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:06:48,558 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25 Second operand 3 states. [2018-11-23 13:06:48,571 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25. Second operand 3 states. Result 130 states and 150 transitions. Complement of second has 5 states. [2018-11-23 13:06:48,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:48,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:06:48,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-23 13:06:48,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 40 letters. Loop has 4 letters. [2018-11-23 13:06:48,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:48,572 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:06:48,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:48,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:48,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:48,623 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 13:06:48,624 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:06:48,624 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25 Second operand 3 states. [2018-11-23 13:06:48,633 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25. Second operand 3 states. Result 130 states and 150 transitions. Complement of second has 5 states. [2018-11-23 13:06:48,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:06:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-23 13:06:48,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 40 letters. Loop has 4 letters. [2018-11-23 13:06:48,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:48,633 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:06:48,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:48,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:48,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:06:48,673 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 13:06:48,673 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 13:06:48,673 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25 Second operand 3 states. [2018-11-23 13:06:48,692 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 101 states and 117 transitions. cyclomatic complexity: 25. Second operand 3 states. Result 127 states and 148 transitions. Complement of second has 4 states. [2018-11-23 13:06:48,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 13:06:48,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:06:48,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2018-11-23 13:06:48,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 40 letters. Loop has 4 letters. [2018-11-23 13:06:48,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:48,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 44 letters. Loop has 4 letters. [2018-11-23 13:06:48,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:48,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 40 letters. Loop has 8 letters. [2018-11-23 13:06:48,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:06:48,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 148 transitions. [2018-11-23 13:06:48,696 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:06:48,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 0 states and 0 transitions. [2018-11-23 13:06:48,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 13:06:48,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 13:06:48,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 13:06:48,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:06:48,697 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:06:48,697 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:06:48,697 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:06:48,697 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-23 13:06:48,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:06:48,697 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:06:48,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 13:06:48,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:06:48 BoogieIcfgContainer [2018-11-23 13:06:48,702 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 13:06:48,702 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:06:48,702 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:06:48,702 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:06:48,703 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:21" (3/4) ... [2018-11-23 13:06:48,705 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:06:48,705 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:06:48,705 INFO L168 Benchmark]: Toolchain (without parser) took 27580.88 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 535.8 MB). Free memory was 956.6 MB in the beginning and 1.2 GB in the end (delta: -227.5 MB). Peak memory consumption was 308.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:06:48,706 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:06:48,706 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2018-11-23 13:06:48,707 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:06:48,707 INFO L168 Benchmark]: Boogie Preprocessor took 23.21 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:06:48,707 INFO L168 Benchmark]: RCFGBuilder took 308.80 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: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2018-11-23 13:06:48,708 INFO L168 Benchmark]: BuchiAutomizer took 26851.72 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 392.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.1 MB). Peak memory consumption was 302.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:06:48,708 INFO L168 Benchmark]: Witness Printer took 2.71 ms. Allocated memory is still 1.6 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:06:48,710 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 359.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.21 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 308.80 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: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 26851.72 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 392.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -90.1 MB). Peak memory consumption was 302.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.71 ms. Allocated memory is still 1.6 GB. Free memory is still 1.2 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 16 terminating modules (9 trivial, 4 deterministic, 3 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 3 locations. One deterministic module has affine ranking function -1 * a + unknown-#length-unknown[__builtin_alloca (delim_len)] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (in_len)] + -1 * s and consists of 5 locations. One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[reject] + -1 * reject and consists of 3 locations. One nondeterministic module has affine ranking function -1 * a + unknown-#length-unknown[a] and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 3 * unknown-#length-unknown[reject] and consists of 11 locations. One nondeterministic module has affine ranking function -1 * i + -1 * reject + unknown-#length-unknown[reject] and consists of 3 locations. 9 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 26.8s and 17 iterations. TraceHistogramMax:3. Analysis of lassos took 21.2s. Construction of modules took 0.8s. Büchi inclusion checks took 4.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 13. Automata minimization 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 283 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 101 states and ocurred in iteration 15. Nontrivial modules had stage [4, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 611 SDtfs, 1441 SDslu, 1256 SDs, 0 SdLazy, 1524 SolverSat, 177 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU7 SILI1 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital373 mio100 ax100 hnf99 lsp96 ukn75 mio100 lsp39 div108 bol100 ite100 ukn100 eq190 hnf85 smp96 dnf151 smp87 tf100 neg95 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 50ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 6 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 88 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...