./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strstr_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2238ddf3-d77e-4eee-bed5-65c37481d3b9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2238ddf3-d77e-4eee-bed5-65c37481d3b9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2238ddf3-d77e-4eee-bed5-65c37481d3b9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2238ddf3-d77e-4eee-bed5-65c37481d3b9/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strstr_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2238ddf3-d77e-4eee-bed5-65c37481d3b9/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2238ddf3-d77e-4eee-bed5-65c37481d3b9/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 938c367f37ddd298c829be75f27a69a6e9a1154b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:10:38,679 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:10:38,680 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:10:38,690 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:10:38,690 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:10:38,691 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:10:38,692 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:10:38,693 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:10:38,694 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:10:38,695 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:10:38,696 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:10:38,696 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:10:38,697 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:10:38,698 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:10:38,699 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:10:38,699 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:10:38,700 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:10:38,702 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:10:38,703 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:10:38,704 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:10:38,705 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:10:38,706 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:10:38,708 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:10:38,708 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:10:38,708 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:10:38,709 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:10:38,710 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:10:38,711 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:10:38,711 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:10:38,712 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:10:38,712 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:10:38,713 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:10:38,714 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:10:38,714 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:10:38,715 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:10:38,715 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:10:38,715 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2238ddf3-d77e-4eee-bed5-65c37481d3b9/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:10:38,727 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:10:38,727 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:10:38,728 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:10:38,728 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:10:38,728 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:10:38,729 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:10:38,729 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:10:38,729 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:10:38,729 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:10:38,730 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:10:38,730 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:10:38,730 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:10:38,730 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:10:38,730 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:10:38,730 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:10:38,730 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:10:38,731 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:10:38,731 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:10:38,731 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:10:38,731 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:10:38,731 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:10:38,731 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:10:38,731 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:10:38,732 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:10:38,732 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:10:38,732 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:10:38,732 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:10:38,735 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:10:38,735 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_2238ddf3-d77e-4eee-bed5-65c37481d3b9/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 -> 938c367f37ddd298c829be75f27a69a6e9a1154b [2018-10-27 06:10:38,760 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:10:38,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:10:38,774 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:10:38,775 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:10:38,775 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:10:38,776 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2238ddf3-d77e-4eee-bed5-65c37481d3b9/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strstr_true-termination.c.i [2018-10-27 06:10:38,828 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2238ddf3-d77e-4eee-bed5-65c37481d3b9/bin-2019/uautomizer/data/67fbb905f/c2e70b77ca4044e59aaa619b6cd07931/FLAG637f432f0 [2018-10-27 06:10:39,245 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:10:39,246 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2238ddf3-d77e-4eee-bed5-65c37481d3b9/sv-benchmarks/c/termination-libowfat/strstr_true-termination.c.i [2018-10-27 06:10:39,257 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2238ddf3-d77e-4eee-bed5-65c37481d3b9/bin-2019/uautomizer/data/67fbb905f/c2e70b77ca4044e59aaa619b6cd07931/FLAG637f432f0 [2018-10-27 06:10:39,268 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2238ddf3-d77e-4eee-bed5-65c37481d3b9/bin-2019/uautomizer/data/67fbb905f/c2e70b77ca4044e59aaa619b6cd07931 [2018-10-27 06:10:39,270 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:10:39,272 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:10:39,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:39,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:10:39,277 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:10:39,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:39" (1/1) ... [2018-10-27 06:10:39,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a13f4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:39, skipping insertion in model container [2018-10-27 06:10:39,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:10:39" (1/1) ... [2018-10-27 06:10:39,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:10:39,323 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:10:39,588 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:39,597 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:10:39,635 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:10:39,668 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:10:39,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:39 WrapperNode [2018-10-27 06:10:39,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:10:39,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:39,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:10:39,670 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:10:39,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:39" (1/1) ... [2018-10-27 06:10:39,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:39" (1/1) ... [2018-10-27 06:10:39,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:10:39,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:10:39,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:10:39,788 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:10:39,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:39" (1/1) ... [2018-10-27 06:10:39,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:39" (1/1) ... [2018-10-27 06:10:39,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:39" (1/1) ... [2018-10-27 06:10:39,799 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:39" (1/1) ... [2018-10-27 06:10:39,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:39" (1/1) ... [2018-10-27 06:10:39,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:39" (1/1) ... [2018-10-27 06:10:39,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:39" (1/1) ... [2018-10-27 06:10:39,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:10:39,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:10:39,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:10:39,828 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:10:39,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2238ddf3-d77e-4eee-bed5-65c37481d3b9/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-10-27 06:10:39,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:10:39,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:10:39,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:10:39,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:10:40,542 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:10:40,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:40 BoogieIcfgContainer [2018-10-27 06:10:40,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:10:40,543 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:10:40,543 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:10:40,546 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:10:40,547 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:40,547 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:10:39" (1/3) ... [2018-10-27 06:10:40,548 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c826ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:40, skipping insertion in model container [2018-10-27 06:10:40,548 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:40,549 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:10:39" (2/3) ... [2018-10-27 06:10:40,549 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c826ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:10:40, skipping insertion in model container [2018-10-27 06:10:40,549 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:10:40,549 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:40" (3/3) ... [2018-10-27 06:10:40,551 INFO L375 chiAutomizerObserver]: Analyzing ICFG strstr_true-termination.c.i [2018-10-27 06:10:40,601 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:10:40,601 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:10:40,602 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:10:40,602 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:10:40,602 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:10:40,602 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:10:40,602 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:10:40,602 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:10:40,602 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:10:40,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. [2018-10-27 06:10:40,640 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-10-27 06:10:40,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:40,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:40,647 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:40,647 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:10:40,647 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:10:40,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states. [2018-10-27 06:10:40,650 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-10-27 06:10:40,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:40,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:40,651 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:40,651 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:10:40,662 INFO L793 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 16#L541true assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset; 40#L543true SUMMARY for call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L543 13#L543-1true main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 37#L545true assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset; 32#L547true SUMMARY for call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L547 35#L547-1true assume { :begin_inline_strstr } true;strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 22#L508true assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 34#L509-5true [2018-10-27 06:10:40,662 INFO L795 eck$LassoCheckResult]: Loop: 34#L509-5true assume true; 43#L509-1true SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 46#L509-2true assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 30#L509-4true strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 34#L509-5true [2018-10-27 06:10:40,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:40,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1149475243, now seen corresponding path program 1 times [2018-10-27 06:10:40,671 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:40,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:40,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:40,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:40,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:40,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:40,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1694276, now seen corresponding path program 1 times [2018-10-27 06:10:40,840 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:40,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:40,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:40,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:40,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:40,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:40,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1065054482, now seen corresponding path program 1 times [2018-10-27 06:10:40,856 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:40,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:40,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:40,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:40,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:42,043 WARN L179 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 114 [2018-10-27 06:10:42,226 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-10-27 06:10:42,247 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:42,248 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:42,248 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:42,248 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:42,248 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:42,248 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:42,248 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:42,248 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:42,251 INFO L131 ssoRankerPreferences]: Filename of dumped script: strstr_true-termination.c.i_Iteration1_Lasso [2018-10-27 06:10:42,251 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:42,251 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:42,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-10-27 06:10:42,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,857 WARN L179 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2018-10-27 06:10:42,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-10-27 06:10:42,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-10-27 06:10:42,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:42,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:43,462 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:43,467 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:43,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:43,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:43,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:43,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:43,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:43,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:43,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:43,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:43,474 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:43,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:43,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:43,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:43,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:43,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:43,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:43,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:43,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:43,477 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:43,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:43,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:43,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:43,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:43,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:43,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:43,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:43,491 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:43,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-10-27 06:10:43,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:43,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:43,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:43,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:43,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:43,495 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:43,503 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:43,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:43,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:43,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:43,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:43,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:43,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:43,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:43,510 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:43,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:43,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:43,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:43,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:43,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:43,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:43,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:43,519 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:43,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-10-27 06:10:43,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:43,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:43,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:43,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:43,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:43,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:43,526 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:43,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-10-27 06:10:43,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:43,527 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:43,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:43,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:43,530 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:43,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:43,540 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:43,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:43,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:43,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:43,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:43,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:43,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:43,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:43,580 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:43,615 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-10-27 06:10:43,615 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:10:43,617 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:43,618 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:43,619 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:43,619 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1) = -1*ULTIMATE.start_strlen_~s.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1 Supporting invariants [] [2018-10-27 06:10:43,708 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-10-27 06:10:43,713 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:10:43,715 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:10:43,715 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:10:43,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:43,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:43,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:44,009 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-10-27 06:10:44,010 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states. Second operand 6 states. [2018-10-27 06:10:44,129 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states.. Second operand 6 states. Result 126 states and 165 transitions. Complement of second has 10 states. [2018-10-27 06:10:44,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:10:44,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2018-10-27 06:10:44,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 110 transitions. Stem has 9 letters. Loop has 4 letters. [2018-10-27 06:10:44,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:44,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 110 transitions. Stem has 13 letters. Loop has 4 letters. [2018-10-27 06:10:44,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:44,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 110 transitions. Stem has 9 letters. Loop has 8 letters. [2018-10-27 06:10:44,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:44,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 165 transitions. [2018-10-27 06:10:44,145 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 42 [2018-10-27 06:10:44,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 71 states and 86 transitions. [2018-10-27 06:10:44,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2018-10-27 06:10:44,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2018-10-27 06:10:44,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 86 transitions. [2018-10-27 06:10:44,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:44,152 INFO L705 BuchiCegarLoop]: Abstraction has 71 states and 86 transitions. [2018-10-27 06:10:44,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 86 transitions. [2018-10-27 06:10:44,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-27 06:10:44,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-27 06:10:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 86 transitions. [2018-10-27 06:10:44,183 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 86 transitions. [2018-10-27 06:10:44,183 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 86 transitions. [2018-10-27 06:10:44,183 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:10:44,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 86 transitions. [2018-10-27 06:10:44,185 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 42 [2018-10-27 06:10:44,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:44,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:44,185 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:44,186 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:10:44,186 INFO L793 eck$LassoCheckResult]: Stem: 330#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 294#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 295#L541 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset; 306#L543 SUMMARY for call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L543 301#L543-1 main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 302#L545 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset; 324#L547 SUMMARY for call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L547 325#L547-1 assume { :begin_inline_strstr } true;strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 313#L508 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 303#L510 strstr_#t~ret11 := strlen_#res;assume { :end_inline_strlen } true;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 304#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 312#L509-12 [2018-10-27 06:10:44,186 INFO L795 eck$LassoCheckResult]: Loop: 312#L509-12 assume true; 317#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 296#L509-9 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 298#L509-11 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 312#L509-12 [2018-10-27 06:10:44,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:44,186 INFO L82 PathProgramCache]: Analyzing trace with hash 839112782, now seen corresponding path program 1 times [2018-10-27 06:10:44,186 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:44,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:44,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:44,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:44,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:44,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:44,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:44,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:10:44,295 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:44,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:44,295 INFO L82 PathProgramCache]: Analyzing trace with hash 2402308, now seen corresponding path program 1 times [2018-10-27 06:10:44,295 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:44,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:44,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:44,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:44,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:44,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:44,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:10:44,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:10:44,367 INFO L87 Difference]: Start difference. First operand 71 states and 86 transitions. cyclomatic complexity: 20 Second operand 4 states. [2018-10-27 06:10:44,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:44,410 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-10-27 06:10:44,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:10:44,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 51 transitions. [2018-10-27 06:10:44,413 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-10-27 06:10:44,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 51 transitions. [2018-10-27 06:10:44,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-10-27 06:10:44,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-10-27 06:10:44,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 51 transitions. [2018-10-27 06:10:44,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:44,415 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-10-27 06:10:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 51 transitions. [2018-10-27 06:10:44,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-27 06:10:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-27 06:10:44,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-10-27 06:10:44,419 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-10-27 06:10:44,419 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-10-27 06:10:44,419 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:10:44,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2018-10-27 06:10:44,420 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2018-10-27 06:10:44,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:44,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:44,421 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:44,421 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-10-27 06:10:44,421 INFO L793 eck$LassoCheckResult]: Stem: 450#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 422#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 423#L541 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset; 431#L543 SUMMARY for call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L543 426#L543-1 main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 427#L545 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset; 445#L547 SUMMARY for call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L547 446#L547-1 assume { :begin_inline_strstr } true;strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 436#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 437#L509-5 assume true; 448#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 452#L509-2 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 449#L509-6 strlen_#res := strlen_~i~0; 424#L510 strstr_#t~ret11 := strlen_#res;assume { :end_inline_strlen } true;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 425#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 434#L509-12 [2018-10-27 06:10:44,421 INFO L795 eck$LassoCheckResult]: Loop: 434#L509-12 assume true; 438#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 417#L509-9 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 419#L509-11 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 434#L509-12 [2018-10-27 06:10:44,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:44,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1315195239, now seen corresponding path program 1 times [2018-10-27 06:10:44,421 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:44,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:44,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:44,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:44,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:44,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:44,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2402308, now seen corresponding path program 2 times [2018-10-27 06:10:44,452 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:44,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:44,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:44,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:44,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:44,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:44,460 INFO L82 PathProgramCache]: Analyzing trace with hash 2035503772, now seen corresponding path program 1 times [2018-10-27 06:10:44,460 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:44,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:44,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:44,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:44,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:45,033 WARN L179 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 133 [2018-10-27 06:10:45,122 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:45,122 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:45,122 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:45,122 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:45,122 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:45,122 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:45,122 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:45,122 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:45,122 INFO L131 ssoRankerPreferences]: Filename of dumped script: strstr_true-termination.c.i_Iteration3_Lasso [2018-10-27 06:10:45,122 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:45,122 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:45,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:45,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:45,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-10-27 06:10:45,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:45,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:45,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-10-27 06:10:45,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-10-27 06:10:45,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:45,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-10-27 06:10:45,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:45,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-10-27 06:10:45,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:45,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-10-27 06:10:45,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-10-27 06:10:45,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-10-27 06:10:45,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-10-27 06:10:45,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:45,435 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 88 [2018-10-27 06:10:45,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:45,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:45,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:45,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:45,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:45,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:45,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:45,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:45,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:45,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:45,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:45,721 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-10-27 06:10:46,079 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:46,079 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:46,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:46,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:46,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:46,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:46,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:46,084 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:46,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-10-27 06:10:46,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:46,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:46,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:46,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:46,089 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:46,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-10-27 06:10:46,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:46,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:46,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,090 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:46,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:46,094 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:46,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:46,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:46,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:46,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:46,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:46,097 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:46,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:46,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:46,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:46,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:46,104 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:46,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:46,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:46,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:46,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:46,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:46,109 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:46,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:46,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:46,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:46,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:46,118 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:46,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:46,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:46,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:46,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:46,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:46,120 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:46,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:46,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:46,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:46,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:46,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:46,122 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:46,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:46,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:46,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:46,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:46,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:46,124 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:46,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:46,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:46,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:46,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:46,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:46,135 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:46,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:46,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:46,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:46,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:46,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:46,142 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:46,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:46,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:46,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:46,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:46,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:46,144 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:46,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:46,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:46,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:46,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:46,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:46,152 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:46,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:46,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:46,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:46,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:46,156 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:46,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:46,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:46,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:46,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:46,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:46,162 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:46,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:46,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:46,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:46,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:46,170 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:46,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:46,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,171 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:46,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,176 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:46,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:46,187 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:46,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:46,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:46,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:46,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:46,193 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:46,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:46,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,194 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:46,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,196 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:46,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:46,206 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:46,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:46,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:46,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:46,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:46,213 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:46,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:46,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:46,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:46,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:46,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:46,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:46,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:46,251 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:46,270 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:10:46,271 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:10:46,271 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:46,272 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:46,272 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:46,272 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc20.base)_2, ULTIMATE.start_strlen_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc20.base)_2 - 1*ULTIMATE.start_strlen_~s.offset Supporting invariants [] [2018-10-27 06:10:46,506 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2018-10-27 06:10:46,507 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:10:46,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:46,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:46,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:46,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:46,651 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2018-10-27 06:10:46,651 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 10 Second operand 7 states. [2018-10-27 06:10:46,745 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 10. Second operand 7 states. Result 89 states and 104 transitions. Complement of second has 9 states. [2018-10-27 06:10:46,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:46,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:10:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2018-10-27 06:10:46,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 70 transitions. Stem has 15 letters. Loop has 4 letters. [2018-10-27 06:10:46,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:46,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 70 transitions. Stem has 19 letters. Loop has 4 letters. [2018-10-27 06:10:46,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:46,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 70 transitions. Stem has 15 letters. Loop has 8 letters. [2018-10-27 06:10:46,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:46,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89 states and 104 transitions. [2018-10-27 06:10:46,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 34 [2018-10-27 06:10:46,750 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89 states to 67 states and 78 transitions. [2018-10-27 06:10:46,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2018-10-27 06:10:46,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2018-10-27 06:10:46,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 78 transitions. [2018-10-27 06:10:46,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:46,750 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-10-27 06:10:46,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 78 transitions. [2018-10-27 06:10:46,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 47. [2018-10-27 06:10:46,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-27 06:10:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-10-27 06:10:46,752 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-10-27 06:10:46,752 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-10-27 06:10:46,753 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:10:46,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 55 transitions. [2018-10-27 06:10:46,754 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-10-27 06:10:46,754 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:46,754 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:46,755 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-10-27 06:10:46,755 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:46,755 INFO L793 eck$LassoCheckResult]: Stem: 729#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 695#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 696#L541 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset; 706#L543 SUMMARY for call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L543 701#L543-1 main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 702#L545 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset; 724#L547 SUMMARY for call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L547 725#L547-1 assume { :begin_inline_strstr } true;strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 713#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 714#L509-5 assume true; 726#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 731#L509-2 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 728#L509-6 strlen_#res := strlen_~i~0; 703#L510 strstr_#t~ret11 := strlen_#res;assume { :end_inline_strlen } true;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 704#L508-2 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 707#L510-1 strstr_#t~ret12 := strlen_#res;assume { :end_inline_strlen } true;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 708#L529 assume !(strstr_~nl~0 % 4294967296 == 0); 710#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := strstr_~hl~0 - strstr_~nl~0 + 1; 711#L531-4 [2018-10-27 06:10:46,755 INFO L795 eck$LassoCheckResult]: Loop: 711#L531-4 assume true; 730#L531-1 assume !!(strstr_~i~1 % 4294967296 != 0); 693#L532 SUMMARY for call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1); srcloc: L532 694#L532-1 SUMMARY for call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1); srcloc: L532-1 705#L532-2 strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 709#L532-3 assume !strstr_#t~short17; 715#L532-5 assume !strstr_#t~short17;havoc strstr_#t~ret16;havoc strstr_#t~mem15;havoc strstr_#t~short17;havoc strstr_#t~mem14;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, strstr_~haystack.offset + 1;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, strstr_~haystack.offset + 1;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 719#L531-3 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 711#L531-4 [2018-10-27 06:10:46,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:46,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2005278508, now seen corresponding path program 1 times [2018-10-27 06:10:46,756 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:46,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:46,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:46,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:46,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:46,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:46,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:46,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:10:46,858 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:46,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:46,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1197642521, now seen corresponding path program 1 times [2018-10-27 06:10:46,858 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:46,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:46,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:46,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:46,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:46,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:10:46,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:10:46,983 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-10-27 06:10:47,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:47,011 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-10-27 06:10:47,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:10:47,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 54 transitions. [2018-10-27 06:10:47,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-10-27 06:10:47,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 54 transitions. [2018-10-27 06:10:47,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2018-10-27 06:10:47,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-10-27 06:10:47,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 54 transitions. [2018-10-27 06:10:47,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:47,014 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-10-27 06:10:47,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 54 transitions. [2018-10-27 06:10:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-27 06:10:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-27 06:10:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-10-27 06:10:47,016 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-10-27 06:10:47,016 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-10-27 06:10:47,016 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:10:47,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 54 transitions. [2018-10-27 06:10:47,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-10-27 06:10:47,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:47,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:47,021 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:47,021 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:47,022 INFO L793 eck$LassoCheckResult]: Stem: 835#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 805#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 806#L541 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset; 814#L543 SUMMARY for call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L543 807#L543-1 main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 808#L545 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset; 830#L547 SUMMARY for call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L547 831#L547-1 assume { :begin_inline_strstr } true;strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 819#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 820#L509-5 assume true; 832#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 837#L509-2 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 834#L509-6 strlen_#res := strlen_~i~0; 809#L510 strstr_#t~ret11 := strlen_#res;assume { :end_inline_strlen } true;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 810#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 821#L509-12 assume true; 823#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 799#L509-9 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 800#L509-13 strlen_#res := strlen_~i~0; 812#L510-1 strstr_#t~ret12 := strlen_#res;assume { :end_inline_strlen } true;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 813#L529 assume !(strstr_~nl~0 % 4294967296 == 0); 816#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := strstr_~hl~0 - strstr_~nl~0 + 1; 817#L531-4 [2018-10-27 06:10:47,022 INFO L795 eck$LassoCheckResult]: Loop: 817#L531-4 assume true; 836#L531-1 assume !!(strstr_~i~1 % 4294967296 != 0); 803#L532 SUMMARY for call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1); srcloc: L532 804#L532-1 SUMMARY for call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1); srcloc: L532-1 811#L532-2 strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 818#L532-3 assume !strstr_#t~short17; 824#L532-5 assume !strstr_#t~short17;havoc strstr_#t~ret16;havoc strstr_#t~mem15;havoc strstr_#t~short17;havoc strstr_#t~mem14;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, strstr_~haystack.offset + 1;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, strstr_~haystack.offset + 1;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 825#L531-3 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 817#L531-4 [2018-10-27 06:10:47,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:47,022 INFO L82 PathProgramCache]: Analyzing trace with hash -952046719, now seen corresponding path program 1 times [2018-10-27 06:10:47,022 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:47,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:47,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:47,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:47,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:47,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:47,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 06:10:47,324 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:47,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:47,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1197642521, now seen corresponding path program 2 times [2018-10-27 06:10:47,324 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:47,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:47,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:47,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:47,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:47,452 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-10-27 06:10:47,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:10:47,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:10:47,470 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-10-27 06:10:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:47,542 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2018-10-27 06:10:47,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:10:47,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 106 transitions. [2018-10-27 06:10:47,544 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 34 [2018-10-27 06:10:47,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 74 states and 83 transitions. [2018-10-27 06:10:47,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2018-10-27 06:10:47,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2018-10-27 06:10:47,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 83 transitions. [2018-10-27 06:10:47,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:47,545 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-10-27 06:10:47,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 83 transitions. [2018-10-27 06:10:47,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 47. [2018-10-27 06:10:47,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-27 06:10:47,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-10-27 06:10:47,548 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-10-27 06:10:47,548 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-10-27 06:10:47,548 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:10:47,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 53 transitions. [2018-10-27 06:10:47,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-10-27 06:10:47,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:47,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:47,554 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, 1, 1, 1, 1] [2018-10-27 06:10:47,554 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:47,554 INFO L793 eck$LassoCheckResult]: Stem: 992#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 962#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 963#L541 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset; 971#L543 SUMMARY for call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L543 964#L543-1 main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 965#L545 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset; 987#L547 SUMMARY for call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L547 988#L547-1 assume { :begin_inline_strstr } true;strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 976#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 977#L509-5 assume true; 989#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 995#L509-2 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 985#L509-4 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 986#L509-5 assume true; 990#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 994#L509-2 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 991#L509-6 strlen_#res := strlen_~i~0; 966#L510 strstr_#t~ret11 := strlen_#res;assume { :end_inline_strlen } true;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 967#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 978#L509-12 assume true; 980#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 956#L509-9 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 957#L509-13 strlen_#res := strlen_~i~0; 969#L510-1 strstr_#t~ret12 := strlen_#res;assume { :end_inline_strlen } true;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 970#L529 assume !(strstr_~nl~0 % 4294967296 == 0); 973#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := strstr_~hl~0 - strstr_~nl~0 + 1; 974#L531-4 [2018-10-27 06:10:47,554 INFO L795 eck$LassoCheckResult]: Loop: 974#L531-4 assume true; 993#L531-1 assume !!(strstr_~i~1 % 4294967296 != 0); 960#L532 SUMMARY for call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1); srcloc: L532 961#L532-1 SUMMARY for call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1); srcloc: L532-1 968#L532-2 strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 975#L532-3 assume !strstr_#t~short17; 981#L532-5 assume !strstr_#t~short17;havoc strstr_#t~ret16;havoc strstr_#t~mem15;havoc strstr_#t~short17;havoc strstr_#t~mem14;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, strstr_~haystack.offset + 1;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, strstr_~haystack.offset + 1;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 982#L531-3 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 974#L531-4 [2018-10-27 06:10:47,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:47,555 INFO L82 PathProgramCache]: Analyzing trace with hash 708959006, now seen corresponding path program 1 times [2018-10-27 06:10:47,555 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:47,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:47,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:47,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:47,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:48,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:48,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:48,048 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2238ddf3-d77e-4eee-bed5-65c37481d3b9/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-10-27 06:10:48,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:48,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:48,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:48,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 06:10:48,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:10:48,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2018-10-27 06:10:48,281 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:48,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:48,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1197642521, now seen corresponding path program 3 times [2018-10-27 06:10:48,282 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:48,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:48,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:48,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,659 WARN L179 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-10-27 06:10:48,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 06:10:48,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-10-27 06:10:48,675 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. cyclomatic complexity: 9 Second operand 12 states. [2018-10-27 06:10:48,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:48,931 INFO L93 Difference]: Finished difference Result 156 states and 174 transitions. [2018-10-27 06:10:48,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 06:10:48,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 174 transitions. [2018-10-27 06:10:48,935 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 68 [2018-10-27 06:10:48,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 144 states and 162 transitions. [2018-10-27 06:10:48,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2018-10-27 06:10:48,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2018-10-27 06:10:48,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 144 states and 162 transitions. [2018-10-27 06:10:48,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:48,941 INFO L705 BuchiCegarLoop]: Abstraction has 144 states and 162 transitions. [2018-10-27 06:10:48,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 162 transitions. [2018-10-27 06:10:48,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 47. [2018-10-27 06:10:48,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-27 06:10:48,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-10-27 06:10:48,944 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-10-27 06:10:48,944 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-10-27 06:10:48,944 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:10:48,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 52 transitions. [2018-10-27 06:10:48,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-10-27 06:10:48,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:48,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:48,949 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] [2018-10-27 06:10:48,949 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:48,949 INFO L793 eck$LassoCheckResult]: Stem: 1302#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1266#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 1267#L541 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset; 1279#L543 SUMMARY for call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L543 1274#L543-1 main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 1275#L545 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset; 1297#L547 SUMMARY for call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L547 1298#L547-1 assume { :begin_inline_strstr } true;strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 1286#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1287#L509-5 assume true; 1299#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 1305#L509-2 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 1295#L509-4 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 1296#L509-5 assume true; 1300#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 1304#L509-2 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 1301#L509-6 strlen_#res := strlen_~i~0; 1276#L510 strstr_#t~ret11 := strlen_#res;assume { :end_inline_strlen } true;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 1277#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1288#L509-12 assume true; 1289#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 1270#L509-9 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 1271#L509-11 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 1282#L509-12 assume true; 1290#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 1268#L509-9 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 1269#L509-13 strlen_#res := strlen_~i~0; 1280#L510-1 strstr_#t~ret12 := strlen_#res;assume { :end_inline_strlen } true;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 1281#L529 assume !(strstr_~nl~0 % 4294967296 == 0); 1283#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := strstr_~hl~0 - strstr_~nl~0 + 1; 1284#L531-4 [2018-10-27 06:10:48,949 INFO L795 eck$LassoCheckResult]: Loop: 1284#L531-4 assume true; 1303#L531-1 assume !!(strstr_~i~1 % 4294967296 != 0); 1272#L532 SUMMARY for call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1); srcloc: L532 1273#L532-1 SUMMARY for call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1); srcloc: L532-1 1278#L532-2 strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 1285#L532-3 assume !strstr_#t~short17; 1291#L532-5 assume !strstr_#t~short17;havoc strstr_#t~ret16;havoc strstr_#t~mem15;havoc strstr_#t~short17;havoc strstr_#t~mem14;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, strstr_~haystack.offset + 1;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, strstr_~haystack.offset + 1;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 1292#L531-3 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 1284#L531-4 [2018-10-27 06:10:48,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:48,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1237635269, now seen corresponding path program 1 times [2018-10-27 06:10:48,950 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:48,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:48,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:48,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:48,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1197642521, now seen corresponding path program 4 times [2018-10-27 06:10:48,988 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:48,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:48,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:48,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:48,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:48,999 INFO L82 PathProgramCache]: Analyzing trace with hash 733659681, now seen corresponding path program 1 times [2018-10-27 06:10:48,999 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:48,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:49,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:49,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:49,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:49,461 WARN L179 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-10-27 06:10:50,007 WARN L179 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 174 [2018-10-27 06:10:50,148 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-10-27 06:10:50,150 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:50,150 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:50,150 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:50,150 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:50,150 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:50,150 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:50,151 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:50,151 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:50,151 INFO L131 ssoRankerPreferences]: Filename of dumped script: strstr_true-termination.c.i_Iteration7_Lasso [2018-10-27 06:10:50,151 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:50,151 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:50,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-10-27 06:10:50,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-10-27 06:10:50,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-10-27 06:10:50,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-10-27 06:10:50,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,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-10-27 06:10:50,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,750 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 108 [2018-10-27 06:10:50,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:50,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:51,390 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:51,390 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:51,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:51,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:51,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:51,397 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:51,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:51,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:51,399 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:51,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:51,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:51,405 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:51,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:51,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:51,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:51,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:51,418 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:51,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:51,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:51,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:51,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:51,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:51,431 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:51,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:51,446 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:51,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:51,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:51,448 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:51,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:51,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:51,454 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:51,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:51,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:51,456 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:51,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:51,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:51,467 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:51,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,468 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:51,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:51,468 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:51,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:51,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:51,470 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:51,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:51,472 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:51,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:51,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:51,474 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:51,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:51,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:51,475 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:51,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:51,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:51,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:51,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:51,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:51,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:51,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:51,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:51,483 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:51,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:51,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:51,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,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-10-27 06:10:51,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:51,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:51,500 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,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-10-27 06:10:51,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:51,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:51,503 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,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-10-27 06:10:51,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,504 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-10-27 06:10:51,504 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:10:51,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,514 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2018-10-27 06:10:51,521 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-10-27 06:10:51,538 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,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-10-27 06:10:51,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,539 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:51,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:51,558 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:51,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:51,562 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:51,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:51,573 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:51,574 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:51,575 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,576 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:51,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,577 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:51,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:51,597 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,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-10-27 06:10:51,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:51,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:51,600 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:51,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:51,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:51,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:51,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:51,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:51,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:51,604 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:51,638 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:51,670 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:10:51,672 INFO L444 ModelExtractionUtils]: 48 out of 55 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:10:51,673 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:51,673 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:51,673 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:51,673 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strstr_~haystack.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc20.base)_3) = -1*ULTIMATE.start_strstr_~haystack.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc20.base)_3 Supporting invariants [] [2018-10-27 06:10:51,835 INFO L297 tatePredicateManager]: 33 out of 34 supporting invariants were superfluous and have been removed [2018-10-27 06:10:51,837 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:10:51,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:51,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:51,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:51,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:51,953 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-10-27 06:10:51,953 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 52 transitions. cyclomatic complexity: 8 Second operand 7 states. [2018-10-27 06:10:52,063 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 52 transitions. cyclomatic complexity: 8. Second operand 7 states. Result 65 states and 74 transitions. Complement of second has 8 states. [2018-10-27 06:10:52,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:52,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-27 06:10:52,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2018-10-27 06:10:52,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 30 letters. Loop has 8 letters. [2018-10-27 06:10:52,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:52,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 38 letters. Loop has 8 letters. [2018-10-27 06:10:52,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:52,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 30 letters. Loop has 16 letters. [2018-10-27 06:10:52,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:52,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 74 transitions. [2018-10-27 06:10:52,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:10:52,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 62 states and 69 transitions. [2018-10-27 06:10:52,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-10-27 06:10:52,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-10-27 06:10:52,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 69 transitions. [2018-10-27 06:10:52,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:52,067 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-10-27 06:10:52,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 69 transitions. [2018-10-27 06:10:52,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-10-27 06:10:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-27 06:10:52,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2018-10-27 06:10:52,072 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-10-27 06:10:52,073 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 68 transitions. [2018-10-27 06:10:52,073 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:10:52,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 68 transitions. [2018-10-27 06:10:52,073 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:10:52,073 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:52,073 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:52,074 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, 1, 1, 1, 1] [2018-10-27 06:10:52,074 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:52,074 INFO L793 eck$LassoCheckResult]: Stem: 1709#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1667#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 1668#L541 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset; 1683#L543 SUMMARY for call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L543 1677#L543-1 main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 1678#L545 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset; 1704#L547 SUMMARY for call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L547 1705#L547-1 assume { :begin_inline_strstr } true;strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 1691#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1692#L509-5 assume true; 1706#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 1713#L509-2 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 1702#L509-4 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 1703#L509-5 assume true; 1707#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 1712#L509-2 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 1708#L509-6 strlen_#res := strlen_~i~0; 1679#L510 strstr_#t~ret11 := strlen_#res;assume { :end_inline_strlen } true;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 1680#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1693#L509-12 assume true; 1694#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 1671#L509-9 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 1672#L509-11 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 1686#L509-12 assume true; 1695#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 1669#L509-9 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 1670#L509-13 strlen_#res := strlen_~i~0; 1684#L510-1 strstr_#t~ret12 := strlen_#res;assume { :end_inline_strlen } true;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 1685#L529 assume !(strstr_~nl~0 % 4294967296 == 0); 1687#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := strstr_~hl~0 - strstr_~nl~0 + 1; 1688#L531-4 assume true; 1710#L531-1 assume !!(strstr_~i~1 % 4294967296 != 0); 1673#L532 SUMMARY for call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1); srcloc: L532 1674#L532-1 SUMMARY for call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1); srcloc: L532-1 1681#L532-2 strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 1689#L532-3 assume strstr_#t~short17;assume { :begin_inline_memcmp } true;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := memcmp_~count + 1;memcmp_~count := memcmp_~count + 1;havoc memcmp_#t~pre5; 1664#L517-4 [2018-10-27 06:10:52,074 INFO L795 eck$LassoCheckResult]: Loop: 1664#L517-4 assume true; 1657#L517-1 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 1658#L517-2 assume !!(memcmp_#t~pre6 % 4294967296 != 0);havoc memcmp_#t~pre6; 1661#L518 SUMMARY for call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1); srcloc: L518 1714#L518-1 SUMMARY for call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1); srcloc: L518-1 1698#L518-2 memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 1699#L518-3 assume !(memcmp_~r~0 != 0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 1664#L517-4 [2018-10-27 06:10:52,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:52,076 INFO L82 PathProgramCache]: Analyzing trace with hash -633872764, now seen corresponding path program 1 times [2018-10-27 06:10:52,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:52,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:52,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:52,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:52,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:52,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:52,119 INFO L82 PathProgramCache]: Analyzing trace with hash -637635867, now seen corresponding path program 1 times [2018-10-27 06:10:52,119 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:52,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:52,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:52,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:52,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:52,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:52,133 INFO L82 PathProgramCache]: Analyzing trace with hash -787821822, now seen corresponding path program 1 times [2018-10-27 06:10:52,133 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:52,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:52,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:52,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:52,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:52,657 WARN L179 SmtUtils]: Spent 485.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 06:10:53,692 WARN L179 SmtUtils]: Spent 970.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 212 [2018-10-27 06:10:53,894 WARN L179 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2018-10-27 06:10:53,896 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:10:53,896 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:10:53,896 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:10:53,896 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:10:53,896 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:10:53,897 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:10:53,897 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:10:53,897 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:10:53,897 INFO L131 ssoRankerPreferences]: Filename of dumped script: strstr_true-termination.c.i_Iteration8_Lasso [2018-10-27 06:10:53,897 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:10:53,897 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:10:53,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:53,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:53,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:53,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:53,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:53,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:53,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:53,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-10-27 06:10:53,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:53,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-10-27 06:10:53,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-10-27 06:10:53,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-10-27 06:10:53,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-10-27 06:10:53,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-10-27 06:10:53,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:53,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:53,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:53,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:53,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:53,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:53,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:53,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:54,622 WARN L179 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 142 [2018-10-27 06:10:54,849 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 96 [2018-10-27 06:10:54,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-10-27 06:10:54,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-10-27 06:10:54,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-10-27 06:10:54,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:54,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-10-27 06:10:54,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:10:54,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-10-27 06:10:54,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-10-27 06:10:54,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-10-27 06:10:55,661 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:10:55,661 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:10:55,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-10-27 06:10:55,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:55,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:55,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:55,664 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,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-10-27 06:10:55,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:55,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:55,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:55,674 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,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-10-27 06:10:55,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:55,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:55,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:55,676 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,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-10-27 06:10:55,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:55,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:55,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:55,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,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-10-27 06:10:55,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:55,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:55,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:55,679 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:55,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:55,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:55,691 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,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-10-27 06:10:55,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,693 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:55,693 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:55,694 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,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-10-27 06:10:55,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:55,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:55,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:55,695 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,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-10-27 06:10:55,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:55,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:55,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:55,713 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:55,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:55,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:55,715 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:55,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:55,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:55,716 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:55,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:55,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:55,718 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:55,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:55,720 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:55,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:55,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:55,734 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:55,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:55,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:55,736 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:55,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:55,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:55,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:55,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:55,777 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:55,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,778 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:55,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:55,779 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:55,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:55,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:55,789 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:55,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:55,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:55,791 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:10:55,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:10:55,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:10:55,792 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,794 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:55,794 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:55,796 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:55,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:55,806 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:55,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:55,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:55,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:55,811 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:55,825 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:55,826 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:55,828 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:55,830 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:55,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:55,835 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,836 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:10:55,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,850 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:10:55,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:55,857 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:10:55,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:10:55,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:10:55,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:10:55,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:10:55,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:10:55,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:10:55,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:10:55,933 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:10:55,962 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:10:55,962 INFO L444 ModelExtractionUtils]: 75 out of 79 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-10-27 06:10:55,963 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:10:55,963 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:10:55,963 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:10:55,963 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_memcmp_~s~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_4) = -1*ULTIMATE.start_memcmp_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_4 Supporting invariants [] [2018-10-27 06:10:56,393 INFO L297 tatePredicateManager]: 42 out of 43 supporting invariants were superfluous and have been removed [2018-10-27 06:10:56,394 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-27 06:10:56,395 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:10:56,395 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-10-27 06:10:56,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:56,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:56,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:56,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:56,475 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-10-27 06:10:56,476 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 68 transitions. cyclomatic complexity: 11 Second operand 6 states. [2018-10-27 06:10:56,559 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 68 transitions. cyclomatic complexity: 11. Second operand 6 states. Result 164 states and 182 transitions. Complement of second has 9 states. [2018-10-27 06:10:56,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:10:56,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:10:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-10-27 06:10:56,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 63 transitions. Stem has 36 letters. Loop has 7 letters. [2018-10-27 06:10:56,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:56,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 63 transitions. Stem has 43 letters. Loop has 7 letters. [2018-10-27 06:10:56,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:56,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 63 transitions. Stem has 36 letters. Loop has 14 letters. [2018-10-27 06:10:56,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:10:56,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 182 transitions. [2018-10-27 06:10:56,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:10:56,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 113 states and 126 transitions. [2018-10-27 06:10:56,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-10-27 06:10:56,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-10-27 06:10:56,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 126 transitions. [2018-10-27 06:10:56,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:56,570 INFO L705 BuchiCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-10-27 06:10:56,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 126 transitions. [2018-10-27 06:10:56,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 82. [2018-10-27 06:10:56,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-27 06:10:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-10-27 06:10:56,575 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-10-27 06:10:56,575 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-10-27 06:10:56,575 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:10:56,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 91 transitions. [2018-10-27 06:10:56,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:10:56,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:56,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:56,577 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:56,577 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:56,577 INFO L793 eck$LassoCheckResult]: Stem: 2275#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2238#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 2239#L541 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset; 2248#L543 SUMMARY for call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L543 2242#L543-1 main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 2243#L545 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset; 2269#L547 SUMMARY for call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L547 2270#L547-1 assume { :begin_inline_strstr } true;strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 2255#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 2256#L509-5 assume true; 2271#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 2279#L509-2 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 2267#L509-4 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 2268#L509-5 assume true; 2272#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 2278#L509-2 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 2273#L509-6 strlen_#res := strlen_~i~0; 2240#L510 strstr_#t~ret11 := strlen_#res;assume { :end_inline_strlen } true;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 2241#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 2257#L509-12 assume true; 2258#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 2232#L509-9 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 2233#L509-11 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 2249#L509-12 assume true; 2259#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 2230#L509-9 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 2231#L509-13 strlen_#res := strlen_~i~0; 2246#L510-1 strstr_#t~ret12 := strlen_#res;assume { :end_inline_strlen } true;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 2247#L529 assume !(strstr_~nl~0 % 4294967296 == 0); 2250#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := strstr_~hl~0 - strstr_~nl~0 + 1; 2251#L531-4 assume true; 2285#L531-1 assume !!(strstr_~i~1 % 4294967296 != 0); 2300#L532 SUMMARY for call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1); srcloc: L532 2299#L532-1 SUMMARY for call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1); srcloc: L532-1 2253#L532-2 strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 2254#L532-3 assume strstr_#t~short17;assume { :begin_inline_memcmp } true;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := memcmp_~count + 1;memcmp_~count := memcmp_~count + 1;havoc memcmp_#t~pre5; 2261#L517-4 assume true; 2289#L517-1 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2290#L517-2 assume !(memcmp_#t~pre6 % 4294967296 != 0);havoc memcmp_#t~pre6; 2228#L517-5 memcmp_#res := 0; 2229#L523 strstr_#t~ret16 := memcmp_#res;assume { :end_inline_memcmp } true;strstr_#t~short17 := strstr_#t~ret16 == 0; 2274#L532-5 assume !strstr_#t~short17;havoc strstr_#t~ret16;havoc strstr_#t~mem15;havoc strstr_#t~short17;havoc strstr_#t~mem14;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, strstr_~haystack.offset + 1;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, strstr_~haystack.offset + 1;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 2298#L531-3 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 2297#L531-4 assume true; 2276#L531-1 assume !!(strstr_~i~1 % 4294967296 != 0); 2234#L532 SUMMARY for call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1); srcloc: L532 2235#L532-1 SUMMARY for call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1); srcloc: L532-1 2244#L532-2 strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 2252#L532-3 assume strstr_#t~short17;assume { :begin_inline_memcmp } true;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := memcmp_~count + 1;memcmp_~count := memcmp_~count + 1;havoc memcmp_#t~pre5; 2225#L517-4 [2018-10-27 06:10:56,577 INFO L795 eck$LassoCheckResult]: Loop: 2225#L517-4 assume true; 2219#L517-1 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2220#L517-2 assume !!(memcmp_#t~pre6 % 4294967296 != 0);havoc memcmp_#t~pre6; 2223#L518 SUMMARY for call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1); srcloc: L518 2280#L518-1 SUMMARY for call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1); srcloc: L518-1 2263#L518-2 memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 2264#L518-3 assume !(memcmp_~r~0 != 0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 2225#L517-4 [2018-10-27 06:10:56,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:56,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1759235271, now seen corresponding path program 1 times [2018-10-27 06:10:56,578 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:56,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:56,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:56,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:56,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 06:10:56,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:10:56,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:10:56,691 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:56,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:56,691 INFO L82 PathProgramCache]: Analyzing trace with hash -637635867, now seen corresponding path program 2 times [2018-10-27 06:10:56,691 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:56,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:56,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:56,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:56,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:56,816 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 06:10:56,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:10:56,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:10:56,838 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-10-27 06:10:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:56,854 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2018-10-27 06:10:56,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:10:56,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 92 transitions. [2018-10-27 06:10:56,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:10:56,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 81 states and 88 transitions. [2018-10-27 06:10:56,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-10-27 06:10:56,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-10-27 06:10:56,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 88 transitions. [2018-10-27 06:10:56,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:56,857 INFO L705 BuchiCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-10-27 06:10:56,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 88 transitions. [2018-10-27 06:10:56,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-10-27 06:10:56,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-27 06:10:56,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-10-27 06:10:56,860 INFO L728 BuchiCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-10-27 06:10:56,860 INFO L608 BuchiCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-10-27 06:10:56,860 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-10-27 06:10:56,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 88 transitions. [2018-10-27 06:10:56,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:10:56,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:56,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:56,866 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:56,866 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:56,866 INFO L793 eck$LassoCheckResult]: Stem: 2449#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2403#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 2404#L541 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset; 2419#L543 SUMMARY for call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L543 2413#L543-1 main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 2414#L545 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset; 2441#L547 SUMMARY for call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L547 2442#L547-1 assume { :begin_inline_strstr } true;strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 2427#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 2428#L509-5 assume true; 2444#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 2453#L509-2 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 2439#L509-4 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 2440#L509-5 assume true; 2445#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 2452#L509-2 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 2446#L509-6 strlen_#res := strlen_~i~0; 2415#L510 strstr_#t~ret11 := strlen_#res;assume { :end_inline_strlen } true;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 2416#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 2429#L509-12 assume true; 2430#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 2407#L509-9 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 2408#L509-11 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 2422#L509-12 assume true; 2431#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 2405#L509-9 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 2406#L509-13 strlen_#res := strlen_~i~0; 2420#L510-1 strstr_#t~ret12 := strlen_#res;assume { :end_inline_strlen } true;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 2421#L529 assume !(strstr_~nl~0 % 4294967296 == 0); 2423#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := strstr_~hl~0 - strstr_~nl~0 + 1; 2424#L531-4 assume true; 2451#L531-1 assume !!(strstr_~i~1 % 4294967296 != 0); 2411#L532 SUMMARY for call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1); srcloc: L532 2412#L532-1 SUMMARY for call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1); srcloc: L532-1 2418#L532-2 strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 2426#L532-3 assume strstr_#t~short17;assume { :begin_inline_memcmp } true;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := memcmp_~count + 1;memcmp_~count := memcmp_~count + 1;havoc memcmp_#t~pre5; 2433#L517-4 assume true; 2396#L517-1 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2397#L517-2 assume !!(memcmp_#t~pre6 % 4294967296 != 0);havoc memcmp_#t~pre6; 2399#L518 SUMMARY for call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1); srcloc: L518 2455#L518-1 SUMMARY for call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1); srcloc: L518-1 2437#L518-2 memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 2438#L518-3 assume memcmp_~r~0 != 0;havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#res := memcmp_~r~0; 2447#L523 strstr_#t~ret16 := memcmp_#res;assume { :end_inline_memcmp } true;strstr_#t~short17 := strstr_#t~ret16 == 0; 2448#L532-5 assume !strstr_#t~short17;havoc strstr_#t~ret16;havoc strstr_#t~mem15;havoc strstr_#t~short17;havoc strstr_#t~mem14;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, strstr_~haystack.offset + 1;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, strstr_~haystack.offset + 1;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 2458#L531-3 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 2457#L531-4 assume true; 2450#L531-1 assume !!(strstr_~i~1 % 4294967296 != 0); 2409#L532 SUMMARY for call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1); srcloc: L532 2410#L532-1 SUMMARY for call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1); srcloc: L532-1 2417#L532-2 strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 2425#L532-3 assume strstr_#t~short17;assume { :begin_inline_memcmp } true;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := memcmp_~count + 1;memcmp_~count := memcmp_~count + 1;havoc memcmp_#t~pre5; 2400#L517-4 [2018-10-27 06:10:56,866 INFO L795 eck$LassoCheckResult]: Loop: 2400#L517-4 assume true; 2394#L517-1 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2395#L517-2 assume !!(memcmp_#t~pre6 % 4294967296 != 0);havoc memcmp_#t~pre6; 2398#L518 SUMMARY for call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1); srcloc: L518 2454#L518-1 SUMMARY for call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1); srcloc: L518-1 2435#L518-2 memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 2436#L518-3 assume !(memcmp_~r~0 != 0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 2400#L517-4 [2018-10-27 06:10:56,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:56,866 INFO L82 PathProgramCache]: Analyzing trace with hash 2080015035, now seen corresponding path program 1 times [2018-10-27 06:10:56,866 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:56,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:56,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:56,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:56,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:57,055 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:10:57,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:57,055 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2238ddf3-d77e-4eee-bed5-65c37481d3b9/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-10-27 06:10:57,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:57,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:57,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-10-27 06:10:57,278 INFO L477 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 22 treesize of output 15 [2018-10-27 06:10:57,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:57,287 INFO L477 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 15 treesize of output 8 [2018-10-27 06:10:57,288 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:57,296 INFO L477 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 18 treesize of output 3 [2018-10-27 06:10:57,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:57,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:57,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:57,303 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-10-27 06:10:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 06:10:57,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:10:57,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2018-10-27 06:10:57,408 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:57,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:57,408 INFO L82 PathProgramCache]: Analyzing trace with hash -637635867, now seen corresponding path program 3 times [2018-10-27 06:10:57,408 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:57,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:57,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:57,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:57,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:57,805 WARN L179 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 06:10:57,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 06:10:57,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2018-10-27 06:10:57,877 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. cyclomatic complexity: 13 Second operand 19 states. [2018-10-27 06:10:58,992 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-10-27 06:10:59,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:59,577 INFO L93 Difference]: Finished difference Result 356 states and 377 transitions. [2018-10-27 06:10:59,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-27 06:10:59,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 356 states and 377 transitions. [2018-10-27 06:10:59,581 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-10-27 06:10:59,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 356 states to 289 states and 309 transitions. [2018-10-27 06:10:59,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2018-10-27 06:10:59,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2018-10-27 06:10:59,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 289 states and 309 transitions. [2018-10-27 06:10:59,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:59,583 INFO L705 BuchiCegarLoop]: Abstraction has 289 states and 309 transitions. [2018-10-27 06:10:59,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states and 309 transitions. [2018-10-27 06:10:59,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 103. [2018-10-27 06:10:59,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-27 06:10:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-10-27 06:10:59,591 INFO L728 BuchiCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-10-27 06:10:59,591 INFO L608 BuchiCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-10-27 06:10:59,591 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-10-27 06:10:59,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 111 transitions. [2018-10-27 06:10:59,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:10:59,592 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:59,592 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:59,597 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:59,597 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:10:59,597 INFO L793 eck$LassoCheckResult]: Stem: 3141#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3089#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 3090#L541 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset; 3105#L543 SUMMARY for call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L543 3099#L543-1 main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 3100#L545 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset; 3131#L547 SUMMARY for call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L547 3132#L547-1 assume { :begin_inline_strstr } true;strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 3113#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 3114#L509-5 assume true; 3133#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 3159#L509-2 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 3128#L509-4 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3129#L509-5 assume true; 3144#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 3145#L509-2 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 3137#L509-6 strlen_#res := strlen_~i~0; 3138#L510 strstr_#t~ret11 := strlen_#res;assume { :end_inline_strlen } true;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 3120#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 3121#L509-12 assume true; 3158#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 3157#L509-9 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 3156#L509-11 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3117#L509-12 assume true; 3116#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 3093#L509-9 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 3094#L509-11 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3108#L509-12 assume true; 3140#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 3091#L509-9 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 3092#L509-13 strlen_#res := strlen_~i~0; 3106#L510-1 strstr_#t~ret12 := strlen_#res;assume { :end_inline_strlen } true;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 3107#L529 assume !(strstr_~nl~0 % 4294967296 == 0); 3109#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := strstr_~hl~0 - strstr_~nl~0 + 1; 3110#L531-4 assume true; 3153#L531-1 assume !!(strstr_~i~1 % 4294967296 != 0); 3165#L532 SUMMARY for call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1); srcloc: L532 3164#L532-1 SUMMARY for call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1); srcloc: L532-1 3163#L532-2 strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 3162#L532-3 assume strstr_#t~short17;assume { :begin_inline_memcmp } true;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := memcmp_~count + 1;memcmp_~count := memcmp_~count + 1;havoc memcmp_#t~pre5; 3088#L517-4 assume true; 3083#L517-1 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 3084#L517-2 assume !!(memcmp_#t~pre6 % 4294967296 != 0);havoc memcmp_#t~pre6; 3086#L518 SUMMARY for call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1); srcloc: L518 3148#L518-1 SUMMARY for call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1); srcloc: L518-1 3126#L518-2 memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 3127#L518-3 assume !(memcmp_~r~0 != 0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 3130#L517-4 assume true; 3173#L517-1 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 3174#L517-2 assume !!(memcmp_#t~pre6 % 4294967296 != 0);havoc memcmp_#t~pre6; 3169#L518 SUMMARY for call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1); srcloc: L518 3170#L518-1 SUMMARY for call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1); srcloc: L518-1 3166#L518-2 memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 3154#L518-3 assume memcmp_~r~0 != 0;havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#res := memcmp_~r~0; 3139#L523 strstr_#t~ret16 := memcmp_#res;assume { :end_inline_memcmp } true;strstr_#t~short17 := strstr_#t~ret16 == 0; 3118#L532-5 assume !strstr_#t~short17;havoc strstr_#t~ret16;havoc strstr_#t~mem15;havoc strstr_#t~short17;havoc strstr_#t~mem14;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, strstr_~haystack.offset + 1;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, strstr_~haystack.offset + 1;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 3160#L531-3 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 3155#L531-4 assume true; 3142#L531-1 assume !!(strstr_~i~1 % 4294967296 != 0); 3095#L532 SUMMARY for call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1); srcloc: L532 3096#L532-1 SUMMARY for call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1); srcloc: L532-1 3103#L532-2 strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 3111#L532-3 assume strstr_#t~short17;assume { :begin_inline_memcmp } true;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := memcmp_~count + 1;memcmp_~count := memcmp_~count + 1;havoc memcmp_#t~pre5; 3087#L517-4 [2018-10-27 06:10:59,597 INFO L795 eck$LassoCheckResult]: Loop: 3087#L517-4 assume true; 3081#L517-1 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 3082#L517-2 assume !!(memcmp_#t~pre6 % 4294967296 != 0);havoc memcmp_#t~pre6; 3085#L518 SUMMARY for call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1); srcloc: L518 3147#L518-1 SUMMARY for call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1); srcloc: L518-1 3124#L518-2 memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 3125#L518-3 assume !(memcmp_~r~0 != 0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 3087#L517-4 [2018-10-27 06:10:59,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:59,598 INFO L82 PathProgramCache]: Analyzing trace with hash -886368580, now seen corresponding path program 1 times [2018-10-27 06:10:59,598 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:59,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:59,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:59,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:59,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 06:10:59,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:59,731 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2238ddf3-d77e-4eee-bed5-65c37481d3b9/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-10-27 06:10:59,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:59,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-27 06:10:59,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:10:59,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-27 06:10:59,828 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:10:59,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:59,829 INFO L82 PathProgramCache]: Analyzing trace with hash -637635867, now seen corresponding path program 4 times [2018-10-27 06:10:59,829 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:59,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:59,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:59,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:59,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:59,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 06:10:59,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:10:59,906 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. cyclomatic complexity: 14 Second operand 9 states. [2018-10-27 06:11:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:00,041 INFO L93 Difference]: Finished difference Result 209 states and 224 transitions. [2018-10-27 06:11:00,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 06:11:00,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 224 transitions. [2018-10-27 06:11:00,043 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-10-27 06:11:00,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 166 states and 179 transitions. [2018-10-27 06:11:00,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2018-10-27 06:11:00,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2018-10-27 06:11:00,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 166 states and 179 transitions. [2018-10-27 06:11:00,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:00,045 INFO L705 BuchiCegarLoop]: Abstraction has 166 states and 179 transitions. [2018-10-27 06:11:00,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states and 179 transitions. [2018-10-27 06:11:00,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 93. [2018-10-27 06:11:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-27 06:11:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-10-27 06:11:00,049 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-10-27 06:11:00,049 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-10-27 06:11:00,049 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-10-27 06:11:00,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 100 transitions. [2018-10-27 06:11:00,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:00,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:00,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:00,050 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:00,051 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:00,051 INFO L793 eck$LassoCheckResult]: Stem: 3658#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3611#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 3612#L541 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset; 3627#L543 SUMMARY for call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L543 3621#L543-1 main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 3622#L545 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset; 3651#L547 SUMMARY for call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L547 3652#L547-1 assume { :begin_inline_strstr } true;strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 3635#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 3636#L509-5 assume true; 3653#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 3663#L509-2 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 3647#L509-4 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3648#L509-5 assume true; 3654#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 3670#L509-2 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 3669#L509-4 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3668#L509-5 assume true; 3661#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 3662#L509-2 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 3655#L509-6 strlen_#res := strlen_~i~0; 3623#L510 strstr_#t~ret11 := strlen_#res;assume { :end_inline_strlen } true;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 3624#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 3637#L509-12 assume true; 3638#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 3615#L509-9 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 3616#L509-11 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3630#L509-12 assume true; 3639#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 3613#L509-9 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 3614#L509-13 strlen_#res := strlen_~i~0; 3628#L510-1 strstr_#t~ret12 := strlen_#res;assume { :end_inline_strlen } true;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 3629#L529 assume !(strstr_~nl~0 % 4294967296 == 0); 3631#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := strstr_~hl~0 - strstr_~nl~0 + 1; 3632#L531-4 assume true; 3660#L531-1 assume !!(strstr_~i~1 % 4294967296 != 0); 3619#L532 SUMMARY for call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1); srcloc: L532 3620#L532-1 SUMMARY for call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1); srcloc: L532-1 3626#L532-2 strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 3634#L532-3 assume strstr_#t~short17;assume { :begin_inline_memcmp } true;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := memcmp_~count + 1;memcmp_~count := memcmp_~count + 1;havoc memcmp_#t~pre5; 3641#L517-4 assume true; 3691#L517-1 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 3695#L517-2 assume !!(memcmp_#t~pre6 % 4294967296 != 0);havoc memcmp_#t~pre6; 3694#L518 SUMMARY for call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1); srcloc: L518 3693#L518-1 SUMMARY for call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1); srcloc: L518-1 3692#L518-2 memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 3649#L518-3 assume !(memcmp_~r~0 != 0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 3650#L517-4 assume true; 3690#L517-1 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 3689#L517-2 assume !!(memcmp_#t~pre6 % 4294967296 != 0);havoc memcmp_#t~pre6; 3688#L518 SUMMARY for call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1); srcloc: L518 3687#L518-1 SUMMARY for call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1); srcloc: L518-1 3686#L518-2 memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 3672#L518-3 assume memcmp_~r~0 != 0;havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#res := memcmp_~r~0; 3656#L523 strstr_#t~ret16 := memcmp_#res;assume { :end_inline_memcmp } true;strstr_#t~short17 := strstr_#t~ret16 == 0; 3657#L532-5 assume !strstr_#t~short17;havoc strstr_#t~ret16;havoc strstr_#t~mem15;havoc strstr_#t~short17;havoc strstr_#t~mem14;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, strstr_~haystack.offset + 1;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, strstr_~haystack.offset + 1;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 3673#L531-3 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 3671#L531-4 assume true; 3659#L531-1 assume !!(strstr_~i~1 % 4294967296 != 0); 3617#L532 SUMMARY for call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1); srcloc: L532 3618#L532-1 SUMMARY for call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1); srcloc: L532-1 3625#L532-2 strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 3633#L532-3 assume strstr_#t~short17;assume { :begin_inline_memcmp } true;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := memcmp_~count + 1;memcmp_~count := memcmp_~count + 1;havoc memcmp_#t~pre5; 3609#L517-4 [2018-10-27 06:11:00,051 INFO L795 eck$LassoCheckResult]: Loop: 3609#L517-4 assume true; 3603#L517-1 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 3604#L517-2 assume !!(memcmp_#t~pre6 % 4294967296 != 0);havoc memcmp_#t~pre6; 3607#L518 SUMMARY for call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1); srcloc: L518 3664#L518-1 SUMMARY for call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1); srcloc: L518-1 3643#L518-2 memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 3644#L518-3 assume !(memcmp_~r~0 != 0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 3609#L517-4 [2018-10-27 06:11:00,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:00,051 INFO L82 PathProgramCache]: Analyzing trace with hash 670249404, now seen corresponding path program 2 times [2018-10-27 06:11:00,051 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:00,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:00,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:00,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:00,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-27 06:11:00,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:00,391 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2238ddf3-d77e-4eee-bed5-65c37481d3b9/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:00,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:11:00,445 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:11:00,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:00,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:01,065 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-27 06:11:01,634 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-10-27 06:11:01,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2018-10-27 06:11:01,878 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:11:01,879 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:11:01,881 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:11:01,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 35 [2018-10-27 06:11:01,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:11:01,902 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:11:01,905 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:11:01,908 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:11:01,908 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:11:01,909 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:11:01,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-10-27 06:11:01,911 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:11:01,975 INFO L477 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 21 treesize of output 14 [2018-10-27 06:11:01,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:11:01,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:11:02,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:11:02,028 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:11 [2018-10-27 06:11:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-27 06:11:02,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:02,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17] total 28 [2018-10-27 06:11:02,129 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:02,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:02,129 INFO L82 PathProgramCache]: Analyzing trace with hash -637635867, now seen corresponding path program 5 times [2018-10-27 06:11:02,129 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:02,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:02,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:02,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:02,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:02,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-27 06:11:02,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=684, Unknown=0, NotChecked=0, Total=756 [2018-10-27 06:11:02,223 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. cyclomatic complexity: 13 Second operand 28 states. [2018-10-27 06:11:04,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:04,711 INFO L93 Difference]: Finished difference Result 524 states and 566 transitions. [2018-10-27 06:11:04,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-27 06:11:04,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 524 states and 566 transitions. [2018-10-27 06:11:04,718 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 35 [2018-10-27 06:11:04,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 524 states to 512 states and 554 transitions. [2018-10-27 06:11:04,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2018-10-27 06:11:04,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2018-10-27 06:11:04,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 512 states and 554 transitions. [2018-10-27 06:11:04,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:04,722 INFO L705 BuchiCegarLoop]: Abstraction has 512 states and 554 transitions. [2018-10-27 06:11:04,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states and 554 transitions. [2018-10-27 06:11:04,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 146. [2018-10-27 06:11:04,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-27 06:11:04,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2018-10-27 06:11:04,735 INFO L728 BuchiCegarLoop]: Abstraction has 146 states and 157 transitions. [2018-10-27 06:11:04,735 INFO L608 BuchiCegarLoop]: Abstraction has 146 states and 157 transitions. [2018-10-27 06:11:04,735 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-10-27 06:11:04,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 146 states and 157 transitions. [2018-10-27 06:11:04,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:04,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:04,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:04,742 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:04,742 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:04,742 INFO L793 eck$LassoCheckResult]: Stem: 4596#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4548#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 4549#L541 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset; 4561#L543 SUMMARY for call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L543 4554#L543-1 main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 4555#L545 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset; 4587#L547 SUMMARY for call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L547 4588#L547-1 assume { :begin_inline_strstr } true;strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 4569#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 4570#L509-5 assume true; 4589#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 4615#L509-2 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 4584#L509-4 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 4585#L509-5 assume true; 4590#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 4619#L509-2 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 4613#L509-4 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 4614#L509-5 assume true; 4599#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 4600#L509-2 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 4591#L509-6 strlen_#res := strlen_~i~0; 4592#L510 strstr_#t~ret11 := strlen_#res;assume { :end_inline_strlen } true;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 4576#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 4577#L509-12 assume true; 4618#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 4552#L509-9 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 4553#L509-11 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 4568#L509-12 assume true; 4575#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 4595#L509-9 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 4617#L509-11 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 4616#L509-12 assume true; 4594#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 4550#L509-9 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 4551#L509-13 strlen_#res := strlen_~i~0; 4562#L510-1 strstr_#t~ret12 := strlen_#res;assume { :end_inline_strlen } true;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 4563#L529 assume !(strstr_~nl~0 % 4294967296 == 0); 4564#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := strstr_~hl~0 - strstr_~nl~0 + 1; 4565#L531-4 assume true; 4598#L531-1 assume !!(strstr_~i~1 % 4294967296 != 0); 4546#L532 SUMMARY for call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1); srcloc: L532 4547#L532-1 SUMMARY for call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1); srcloc: L532-1 4656#L532-2 strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 4626#L532-3 assume strstr_#t~short17;assume { :begin_inline_memcmp } true;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := memcmp_~count + 1;memcmp_~count := memcmp_~count + 1;havoc memcmp_#t~pre5; 4543#L517-4 assume true; 4538#L517-1 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 4539#L517-2 assume !!(memcmp_#t~pre6 % 4294967296 != 0);havoc memcmp_#t~pre6; 4541#L518 SUMMARY for call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1); srcloc: L518 4604#L518-1 SUMMARY for call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1); srcloc: L518-1 4582#L518-2 memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 4583#L518-3 assume !(memcmp_~r~0 != 0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 4586#L517-4 assume true; 4663#L517-1 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 4662#L517-2 assume !!(memcmp_#t~pre6 % 4294967296 != 0);havoc memcmp_#t~pre6; 4661#L518 SUMMARY for call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1); srcloc: L518 4660#L518-1 SUMMARY for call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1); srcloc: L518-1 4659#L518-2 memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 4623#L518-3 assume memcmp_~r~0 != 0;havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#res := memcmp_~r~0; 4593#L523 strstr_#t~ret16 := memcmp_#res;assume { :end_inline_memcmp } true;strstr_#t~short17 := strstr_#t~ret16 == 0; 4572#L532-5 assume !strstr_#t~short17;havoc strstr_#t~ret16;havoc strstr_#t~mem15;havoc strstr_#t~short17;havoc strstr_#t~mem14;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, strstr_~haystack.offset + 1;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, strstr_~haystack.offset + 1;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 4621#L531-3 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 4620#L531-4 assume true; 4597#L531-1 assume !!(strstr_~i~1 % 4294967296 != 0); 4544#L532 SUMMARY for call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1); srcloc: L532 4545#L532-1 SUMMARY for call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1); srcloc: L532-1 4558#L532-2 strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 4566#L532-3 assume strstr_#t~short17;assume { :begin_inline_memcmp } true;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := memcmp_~count + 1;memcmp_~count := memcmp_~count + 1;havoc memcmp_#t~pre5; 4542#L517-4 [2018-10-27 06:11:04,743 INFO L795 eck$LassoCheckResult]: Loop: 4542#L517-4 assume true; 4536#L517-1 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 4537#L517-2 assume !!(memcmp_#t~pre6 % 4294967296 != 0);havoc memcmp_#t~pre6; 4540#L518 SUMMARY for call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1); srcloc: L518 4603#L518-1 SUMMARY for call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1); srcloc: L518-1 4580#L518-2 memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 4581#L518-3 assume !(memcmp_~r~0 != 0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 4542#L517-4 [2018-10-27 06:11:04,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:04,743 INFO L82 PathProgramCache]: Analyzing trace with hash -841704513, now seen corresponding path program 3 times [2018-10-27 06:11:04,743 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:04,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:04,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:04,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:04,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:04,971 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 06:11:04,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:11:04,972 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2238ddf3-d77e-4eee-bed5-65c37481d3b9/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:11:04,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:11:05,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 06:11:05,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:11:05,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:05,186 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 06:11:05,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:05,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2018-10-27 06:11:05,204 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:11:05,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:05,204 INFO L82 PathProgramCache]: Analyzing trace with hash -637635867, now seen corresponding path program 6 times [2018-10-27 06:11:05,205 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:05,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:05,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:05,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:05,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:05,375 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 06:11:05,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-27 06:11:05,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-10-27 06:11:05,397 INFO L87 Difference]: Start difference. First operand 146 states and 157 transitions. cyclomatic complexity: 18 Second operand 18 states. [2018-10-27 06:11:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:11:05,617 INFO L93 Difference]: Finished difference Result 389 states and 418 transitions. [2018-10-27 06:11:05,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 06:11:05,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 389 states and 418 transitions. [2018-10-27 06:11:05,625 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 28 [2018-10-27 06:11:05,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 389 states to 352 states and 380 transitions. [2018-10-27 06:11:05,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2018-10-27 06:11:05,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2018-10-27 06:11:05,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 352 states and 380 transitions. [2018-10-27 06:11:05,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:11:05,627 INFO L705 BuchiCegarLoop]: Abstraction has 352 states and 380 transitions. [2018-10-27 06:11:05,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states and 380 transitions. [2018-10-27 06:11:05,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 150. [2018-10-27 06:11:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-27 06:11:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 161 transitions. [2018-10-27 06:11:05,632 INFO L728 BuchiCegarLoop]: Abstraction has 150 states and 161 transitions. [2018-10-27 06:11:05,632 INFO L608 BuchiCegarLoop]: Abstraction has 150 states and 161 transitions. [2018-10-27 06:11:05,632 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-10-27 06:11:05,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 161 transitions. [2018-10-27 06:11:05,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-10-27 06:11:05,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:11:05,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:11:05,634 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:05,634 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:11:05,634 INFO L793 eck$LassoCheckResult]: Stem: 5360#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5312#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 5313#L541 assume !(main_~in_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~in_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset; 5324#L543 SUMMARY for call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1) * 1, 1); srcloc: L543 5318#L543-1 main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 5319#L545 assume !(main_~out_len~0 < 1);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~out_len~0;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset; 5351#L547 SUMMARY for call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1) * 1, 1); srcloc: L547 5352#L547-1 assume { :begin_inline_strstr } true;strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 5332#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 5333#L509-5 assume true; 5353#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 5382#L509-2 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 5347#L509-4 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 5348#L509-5 assume true; 5354#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 5390#L509-2 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 5380#L509-4 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 5381#L509-5 assume true; 5363#L509-1 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-1 5364#L509-2 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 5355#L509-6 strlen_#res := strlen_~i~0; 5356#L510 strstr_#t~ret11 := strlen_#res;assume { :end_inline_strlen } true;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;assume { :begin_inline_strlen } true;strlen_#in~s.base, strlen_#in~s.offset := strstr_~haystack.base, strstr_~haystack.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 5340#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 5341#L509-12 assume true; 5387#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 5388#L509-9 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 5383#L509-11 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 5384#L509-12 assume true; 5389#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 5385#L509-9 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 5386#L509-11 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 5338#L509-12 assume true; 5339#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 5316#L509-9 assume !!(strlen_#t~mem4 != 0);havoc strlen_#t~mem4;strlen_#t~pre3 := strlen_~i~0 + 1;strlen_~i~0 := strlen_~i~0 + 1;havoc strlen_#t~pre3; 5317#L509-11 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, strlen_~s.offset + 1;strlen_~s.base, strlen_~s.offset := strlen_~s.base, strlen_~s.offset + 1;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 5329#L509-12 assume true; 5359#L509-8 SUMMARY for call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); srcloc: L509-8 5314#L509-9 assume !(strlen_#t~mem4 != 0);havoc strlen_#t~mem4; 5315#L509-13 strlen_#res := strlen_~i~0; 5325#L510-1 strstr_#t~ret12 := strlen_#res;assume { :end_inline_strlen } true;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 5326#L529 assume !(strstr_~nl~0 % 4294967296 == 0); 5330#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := strstr_~hl~0 - strstr_~nl~0 + 1; 5331#L531-4 assume true; 5362#L531-1 assume !!(strstr_~i~1 % 4294967296 != 0); 5310#L532 SUMMARY for call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1); srcloc: L532 5311#L532-1 SUMMARY for call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1); srcloc: L532-1 5323#L532-2 strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 5328#L532-3 assume strstr_#t~short17;assume { :begin_inline_memcmp } true;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := memcmp_~count + 1;memcmp_~count := memcmp_~count + 1;havoc memcmp_#t~pre5; 5335#L517-4 assume true; 5438#L517-1 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 5445#L517-2 assume !!(memcmp_#t~pre6 % 4294967296 != 0);havoc memcmp_#t~pre6; 5368#L518 SUMMARY for call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1); srcloc: L518 5369#L518-1 SUMMARY for call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1); srcloc: L518-1 5441#L518-2 memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 5349#L518-3 assume !(memcmp_~r~0 != 0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 5350#L517-4 assume true; 5435#L517-1 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 5434#L517-2 assume !!(memcmp_#t~pre6 % 4294967296 != 0);havoc memcmp_#t~pre6; 5433#L518 SUMMARY for call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1); srcloc: L518 5432#L518-1 SUMMARY for call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1); srcloc: L518-1 5345#L518-2 memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 5346#L518-3 assume memcmp_~r~0 != 0;havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#res := memcmp_~r~0; 5392#L523 strstr_#t~ret16 := memcmp_#res;assume { :end_inline_memcmp } true;strstr_#t~short17 := strstr_#t~ret16 == 0; 5395#L532-5 assume !strstr_#t~short17;havoc strstr_#t~ret16;havoc strstr_#t~mem15;havoc strstr_#t~short17;havoc strstr_#t~mem14;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, strstr_~haystack.offset + 1;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, strstr_~haystack.offset + 1;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 5393#L531-3 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 5391#L531-4 assume true; 5361#L531-1 assume !!(strstr_~i~1 % 4294967296 != 0); 5308#L532 SUMMARY for call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1); srcloc: L532 5309#L532-1 SUMMARY for call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1); srcloc: L532-1 5322#L532-2 strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 5327#L532-3 assume strstr_#t~short17;assume { :begin_inline_memcmp } true;memcmp_#in~dst.base, memcmp_#in~dst.offset, memcmp_#in~src.base, memcmp_#in~src.offset, memcmp_#in~count := strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0;havoc memcmp_#res;havoc memcmp_#t~pre5, memcmp_#t~mem7, memcmp_#t~mem8, memcmp_#t~pre9.base, memcmp_#t~pre9.offset, memcmp_#t~pre10.base, memcmp_#t~pre10.offset, memcmp_#t~pre6, memcmp_~dst.base, memcmp_~dst.offset, memcmp_~src.base, memcmp_~src.offset, memcmp_~count, memcmp_~r~0, memcmp_~d~0.base, memcmp_~d~0.offset, memcmp_~s~0.base, memcmp_~s~0.offset;memcmp_~dst.base, memcmp_~dst.offset := memcmp_#in~dst.base, memcmp_#in~dst.offset;memcmp_~src.base, memcmp_~src.offset := memcmp_#in~src.base, memcmp_#in~src.offset;memcmp_~count := memcmp_#in~count;havoc memcmp_~r~0;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~dst.base, memcmp_~dst.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~src.base, memcmp_~src.offset;memcmp_#t~pre5 := memcmp_~count + 1;memcmp_~count := memcmp_~count + 1;havoc memcmp_#t~pre5; 5306#L517-4 [2018-10-27 06:11:05,634 INFO L795 eck$LassoCheckResult]: Loop: 5306#L517-4 assume true; 5300#L517-1 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 5301#L517-2 assume !!(memcmp_#t~pre6 % 4294967296 != 0);havoc memcmp_#t~pre6; 5304#L518 SUMMARY for call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1); srcloc: L518 5367#L518-1 SUMMARY for call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1); srcloc: L518-1 5343#L518-2 memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 5344#L518-3 assume !(memcmp_~r~0 != 0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, memcmp_~d~0.offset + 1;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, memcmp_~s~0.offset + 1;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 5306#L517-4 [2018-10-27 06:11:05,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:05,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1897614402, now seen corresponding path program 4 times [2018-10-27 06:11:05,635 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:05,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:05,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:05,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:05,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:05,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:05,703 INFO L82 PathProgramCache]: Analyzing trace with hash -637635867, now seen corresponding path program 7 times [2018-10-27 06:11:05,703 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:05,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:05,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:05,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:11:05,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:05,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:05,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1040321412, now seen corresponding path program 5 times [2018-10-27 06:11:05,719 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:11:05,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:11:05,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:05,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:11:05,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:11:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:11:06,276 WARN L179 SmtUtils]: Spent 494.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 06:11:06,598 WARN L179 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-10-27 06:11:09,451 WARN L179 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 490 DAG size of output: 358 [2018-10-27 06:11:09,765 WARN L179 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2018-10-27 06:11:09,769 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:11:09,769 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:11:09,769 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:11:09,769 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:11:09,769 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:11:09,769 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:11:09,769 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:11:09,769 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:11:09,770 INFO L131 ssoRankerPreferences]: Filename of dumped script: strstr_true-termination.c.i_Iteration14_Lasso [2018-10-27 06:11:09,770 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:11:09,770 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:11:09,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:09,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-10-27 06:11:09,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-10-27 06:11:09,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-10-27 06:11:09,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-10-27 06:11:09,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-10-27 06:11:09,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-10-27 06:11:09,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-10-27 06:11:09,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-10-27 06:11:09,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-10-27 06:11:09,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-10-27 06:11:09,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:09,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-10-27 06:11:09,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-10-27 06:11:09,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-10-27 06:11:09,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:09,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-10-27 06:11:09,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-10-27 06:11:09,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:09,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-10-27 06:11:09,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-10-27 06:11:09,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:11,322 WARN L179 SmtUtils]: Spent 693.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 173 [2018-10-27 06:11:11,662 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 118 [2018-10-27 06:11:11,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:11,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:11,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:11,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:11,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:11,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:11,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:11,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:11,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:11:12,298 WARN L179 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 95 [2018-10-27 06:11:12,916 WARN L179 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2018-10-27 06:11:13,264 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2018-10-27 06:11:13,358 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:11:13,358 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:11:13,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:13,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:13,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:13,360 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:13,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:13,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:13,373 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:13,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:13,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:13,375 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:13,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:13,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:13,384 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:13,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:13,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:13,386 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:13,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:13,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:13,388 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:13,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:13,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:13,395 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:13,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:13,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:13,396 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:13,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:13,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:13,398 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:13,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:13,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:13,400 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:13,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:13,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:13,402 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:13,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:13,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:13,404 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:13,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:13,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:13,406 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:13,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:13,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:13,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:13,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:13,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:13,410 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:13,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:13,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:13,411 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:13,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:13,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:13,421 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:13,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:13,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:13,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:11:13,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:11:13,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:11:13,429 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:13,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:13,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:13,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:13,468 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,469 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:13,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:13,474 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:13,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:13,476 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:13,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:13,479 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,479 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2018-10-27 06:11:13,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,483 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:11:13,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:13,499 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:13,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:13,506 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,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-10-27 06:11:13,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:13,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:13,512 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,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-10-27 06:11:13,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:13,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:13,515 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,516 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:13,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:13,517 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,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-10-27 06:11:13,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:13,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:13,521 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,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-10-27 06:11:13,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,522 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:13,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,522 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,523 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:11:13,523 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:13,524 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,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-10-27 06:11:13,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,526 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:13,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,528 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:11:13,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:13,537 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,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-10-27 06:11:13,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,538 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:11:13,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,540 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:11:13,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:13,547 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:11:13,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:11:13,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:11:13,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:11:13,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:11:13,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:11:13,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:11:13,554 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:11:13,665 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:11:13,720 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:11:13,720 INFO L444 ModelExtractionUtils]: 91 out of 97 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:11:13,720 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:11:13,721 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:11:13,721 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:11:13,722 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~hay~0.base)_1, ULTIMATE.start_memcmp_~d~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~hay~0.base)_1 - 1*ULTIMATE.start_memcmp_~d~0.offset Supporting invariants [] [2018-10-27 06:11:15,160 INFO L297 tatePredicateManager]: 92 out of 94 supporting invariants were superfluous and have been removed [2018-10-27 06:11:15,164 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-10-27 06:11:15,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:15,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:15,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:15,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:15,334 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-10-27 06:11:15,334 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 150 states and 161 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-10-27 06:11:15,468 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 150 states and 161 transitions. cyclomatic complexity: 18. Second operand 6 states. Result 213 states and 230 transitions. Complement of second has 9 states. [2018-10-27 06:11:15,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:15,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:11:15,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-10-27 06:11:15,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 71 letters. Loop has 7 letters. [2018-10-27 06:11:15,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:15,470 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:11:15,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:15,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:15,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:15,689 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2018-10-27 06:11:15,689 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 150 states and 161 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-10-27 06:11:15,745 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 150 states and 161 transitions. cyclomatic complexity: 18. Second operand 6 states. Result 213 states and 230 transitions. Complement of second has 9 states. [2018-10-27 06:11:15,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:11:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-10-27 06:11:15,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 71 letters. Loop has 7 letters. [2018-10-27 06:11:15,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:15,747 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:11:15,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:11:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:15,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:11:15,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:11:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:11:15,853 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-10-27 06:11:15,853 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 150 states and 161 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-10-27 06:11:15,932 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 150 states and 161 transitions. cyclomatic complexity: 18. Second operand 6 states. Result 217 states and 234 transitions. Complement of second has 8 states. [2018-10-27 06:11:15,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-10-27 06:11:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-27 06:11:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2018-10-27 06:11:15,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 62 transitions. Stem has 71 letters. Loop has 7 letters. [2018-10-27 06:11:15,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:15,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 62 transitions. Stem has 78 letters. Loop has 7 letters. [2018-10-27 06:11:15,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:15,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 62 transitions. Stem has 71 letters. Loop has 14 letters. [2018-10-27 06:11:15,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:11:15,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 217 states and 234 transitions. [2018-10-27 06:11:15,941 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:11:15,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 217 states to 0 states and 0 transitions. [2018-10-27 06:11:15,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:11:15,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:11:15,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:11:15,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:11:15,942 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:15,942 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:15,942 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:11:15,942 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-10-27 06:11:15,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:11:15,942 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:11:15,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:11:15,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:11:15 BoogieIcfgContainer [2018-10-27 06:11:15,954 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:11:15,954 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:11:15,954 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:11:15,954 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:11:15,955 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:10:40" (3/4) ... [2018-10-27 06:11:15,959 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:11:15,959 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:11:15,960 INFO L168 Benchmark]: Toolchain (without parser) took 36689.38 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 585.1 MB). Free memory was 957.0 MB in the beginning and 1.1 GB in the end (delta: -185.7 MB). Peak memory consumption was 399.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:15,961 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:11:15,961 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.96 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 932.8 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:15,962 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 932.8 MB in the beginning and 1.1 GB in the end (delta: -212.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:15,964 INFO L168 Benchmark]: Boogie Preprocessor took 40.14 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: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:15,965 INFO L168 Benchmark]: RCFGBuilder took 714.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.5 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:15,965 INFO L168 Benchmark]: BuchiAutomizer took 35410.47 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 433.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.2 MB). Peak memory consumption was 397.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:11:15,966 INFO L168 Benchmark]: Witness Printer took 5.55 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:11:15,970 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 395.96 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 932.8 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 117.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 932.8 MB in the beginning and 1.1 GB in the end (delta: -212.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.14 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: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 714.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.5 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 35410.47 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 433.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -35.2 MB). Peak memory consumption was 397.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.55 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - 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 #Ultimate.alloc_#res - 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 14 terminating modules (9 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 7 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (in_len)] + -1 * s and consists of 7 locations. One deterministic module has affine ranking function -1 * haystack + unknown-#length-unknown[__builtin_alloca (in_len)] and consists of 6 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[hay] + -1 * d and consists of 6 locations. 9 modules have a trivial ranking function, the largest among these consists of 28 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 35.3s and 15 iterations. TraceHistogramMax:4. Analysis of lassos took 28.2s. Construction of modules took 1.8s. Büchi inclusion checks took 4.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 13. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 1003 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 150 states and ocurred in iteration 13. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 754 SDtfs, 2689 SDslu, 3226 SDs, 0 SdLazy, 1931 SolverSat, 254 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU9 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital294 mio100 ax100 hnf99 lsp89 ukn103 mio100 lsp38 div102 bol100 ite100 ukn100 eq197 hnf86 smp99 dnf138 smp89 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 28 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...