./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-libowfat/strstr.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-libowfat/strstr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.24-678e011 [2019-11-19 22:20:53,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:20:53,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:20:53,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:20:53,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:20:53,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:20:53,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:20:53,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:20:53,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:20:53,194 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:20:53,195 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:20:53,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:20:53,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:20:53,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:20:53,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:20:53,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:20:53,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:20:53,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:20:53,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:20:53,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:20:53,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:20:53,226 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:20:53,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:20:53,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:20:53,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:20:53,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:20:53,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:20:53,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:20:53,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:20:53,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:20:53,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:20:53,240 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:20:53,241 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:20:53,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:20:53,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:20:53,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:20:53,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:20:53,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:20:53,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:20:53,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:20:53,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:20:53,249 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-19 22:20:53,269 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:20:53,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:20:53,271 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:20:53,271 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:20:53,272 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:20:53,272 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 22:20:53,272 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 22:20:53,272 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 22:20:53,273 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 22:20:53,273 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 22:20:53,273 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 22:20:53,274 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:20:53,274 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:20:53,274 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:20:53,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:20:53,275 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 22:20:53,275 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 22:20:53,275 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 22:20:53,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:20:53,276 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 22:20:53,276 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:20:53,276 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 22:20:53,277 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:20:53,277 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:20:53,277 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 22:20:53,277 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:20:53,278 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:20:53,278 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 22:20:53,279 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 22:20:53,279 INFO L138 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2019-11-19 22:20:53,593 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:20:53,609 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:20:53,612 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:20:53,613 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:20:53,614 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:20:53,614 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-libowfat/strstr.i [2019-11-19 22:20:53,683 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84e3e8261/0c41e70207b94273aecb27bfdb69a40a/FLAGc979da7e1 [2019-11-19 22:20:54,223 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:20:54,224 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-libowfat/strstr.i [2019-11-19 22:20:54,243 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84e3e8261/0c41e70207b94273aecb27bfdb69a40a/FLAGc979da7e1 [2019-11-19 22:20:54,535 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84e3e8261/0c41e70207b94273aecb27bfdb69a40a [2019-11-19 22:20:54,539 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:20:54,541 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:20:54,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:20:54,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:20:54,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:20:54,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:20:54" (1/1) ... [2019-11-19 22:20:54,550 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9110ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:54, skipping insertion in model container [2019-11-19 22:20:54,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:20:54" (1/1) ... [2019-11-19 22:20:54,558 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:20:54,621 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:20:55,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:20:55,053 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:20:55,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:20:55,153 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:20:55,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:55 WrapperNode [2019-11-19 22:20:55,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:20:55,155 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:20:55,155 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:20:55,155 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:20:55,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:55" (1/1) ... [2019-11-19 22:20:55,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:55" (1/1) ... [2019-11-19 22:20:55,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:20:55,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:20:55,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:20:55,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:20:55,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:55" (1/1) ... [2019-11-19 22:20:55,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:55" (1/1) ... [2019-11-19 22:20:55,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:55" (1/1) ... [2019-11-19 22:20:55,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:55" (1/1) ... [2019-11-19 22:20:55,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:55" (1/1) ... [2019-11-19 22:20:55,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:55" (1/1) ... [2019-11-19 22:20:55,291 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:55" (1/1) ... [2019-11-19 22:20:55,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:20:55,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:20:55,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:20:55,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:20:55,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-11-19 22:20:55,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 22:20:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 22:20:55,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 22:20:55,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:20:55,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:20:55,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:20:55,789 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:20:55,790 INFO L285 CfgBuilder]: Removed 16 assume(true) statements. [2019-11-19 22:20:55,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:20:55 BoogieIcfgContainer [2019-11-19 22:20:55,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:20:55,792 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 22:20:55,792 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 22:20:55,799 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 22:20:55,806 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:20:55,807 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 10:20:54" (1/3) ... [2019-11-19 22:20:55,808 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79167bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:20:55, skipping insertion in model container [2019-11-19 22:20:55,809 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:20:55,809 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:20:55" (2/3) ... [2019-11-19 22:20:55,810 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79167bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:20:55, skipping insertion in model container [2019-11-19 22:20:55,811 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:20:55,811 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:20:55" (3/3) ... [2019-11-19 22:20:55,814 INFO L371 chiAutomizerObserver]: Analyzing ICFG strstr.i [2019-11-19 22:20:55,865 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 22:20:55,865 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 22:20:55,866 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 22:20:55,866 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:20:55,866 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:20:55,866 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 22:20:55,866 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:20:55,867 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 22:20:55,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-11-19 22:20:55,908 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-19 22:20:55,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:55,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:55,917 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-19 22:20:55,917 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:20:55,917 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 22:20:55,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-11-19 22:20:55,921 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-11-19 22:20:55,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:55,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:55,921 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-19 22:20:55,922 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:20:55,930 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true 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; 14#L541true assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 25#L545true assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);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;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; 19#L508true assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 23#L509-4true [2019-11-19 22:20:55,931 INFO L796 eck$LassoCheckResult]: Loop: 23#L509-4true call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 29#L509-1true assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 34#L509-3true strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 23#L509-4true [2019-11-19 22:20:55,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:55,937 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2019-11-19 22:20:55,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:55,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662953086] [2019-11-19 22:20:55,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:56,106 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:56,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:56,108 INFO L82 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 1 times [2019-11-19 22:20:56,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:56,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002921583] [2019-11-19 22:20:56,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:56,125 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:56,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:56,127 INFO L82 PathProgramCache]: Analyzing trace with hash 179566670, now seen corresponding path program 1 times [2019-11-19 22:20:56,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:56,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324489693] [2019-11-19 22:20:56,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:56,198 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:56,764 WARN L191 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 96 [2019-11-19 22:20:56,942 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-19 22:20:56,956 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:20:56,957 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:20:56,957 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:20:56,957 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:20:56,957 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:20:56,958 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:56,958 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:20:56,958 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:20:56,958 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration1_Lasso [2019-11-19 22:20:56,958 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:20:56,959 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:20:57,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,390 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-11-19 22:20:57,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:57,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:20:58,162 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:20:58,170 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:58,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:20:58,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:58,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:58,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:58,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:58,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:58,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:58,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:58,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:58,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:20:58,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:58,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:58,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:58,221 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:58,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:58,222 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:58,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:20:58,224 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:58,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:20:58,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:58,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:58,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:58,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:58,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:58,271 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:20:58,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:20:58,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:58,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:20:58,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:58,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:58,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:58,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:58,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:20:58,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:20:58,306 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:58,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:20:58,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:58,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:20:58,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:58,320 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-19 22:20:58,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:58,321 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-19 22:20:58,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:58,324 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:58,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:20:58,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:58,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:58,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:58,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:58,353 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:20:58,353 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:20:58,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:58,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:20:58,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:58,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:58,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:58,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:58,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:20:58,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:20:58,414 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:58,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:20:58,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:58,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:58,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:58,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:58,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:20:58,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:20:58,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:58,465 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:20:58,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:20:58,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:20:58,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:20:58,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:20:58,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:20:58,477 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:20:58,492 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:20:58,575 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-11-19 22:20:58,576 INFO L444 ModelExtractionUtils]: 8 out of 31 variables were initially zero. Simplification set additionally 20 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:20:58,641 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:20:58,661 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 22:20:58,662 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:20:58,663 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_1, ULTIMATE.start_strlen_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_1 - 1*ULTIMATE.start_strlen_~s.offset Supporting invariants [] [2019-11-19 22:20:58,698 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2019-11-19 22:20:58,710 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 22:20:58,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:58,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:20:58,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:58,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:20:58,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:20:58,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:58,846 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-19 22:20:58,847 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 4 states. [2019-11-19 22:20:58,989 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 4 states. Result 90 states and 130 transitions. Complement of second has 7 states. [2019-11-19 22:20:58,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-19 22:20:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-19 22:20:58,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2019-11-19 22:20:58,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-19 22:20:59,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:59,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-19 22:20:59,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:59,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-19 22:20:59,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:20:59,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 130 transitions. [2019-11-19 22:20:59,018 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2019-11-19 22:20:59,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 47 states and 62 transitions. [2019-11-19 22:20:59,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2019-11-19 22:20:59,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-11-19 22:20:59,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 62 transitions. [2019-11-19 22:20:59,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:59,035 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-19 22:20:59,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 62 transitions. [2019-11-19 22:20:59,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-19 22:20:59,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-19 22:20:59,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-11-19 22:20:59,078 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-19 22:20:59,078 INFO L591 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-19 22:20:59,078 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 22:20:59,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 62 transitions. [2019-11-19 22:20:59,083 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2019-11-19 22:20:59,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:59,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:59,084 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:20:59,084 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:20:59,085 INFO L794 eck$LassoCheckResult]: Stem: 247#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 224#L-1 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; 225#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 232#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);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;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; 237#L508 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 239#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;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; 252#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 228#L509-10 [2019-11-19 22:20:59,085 INFO L796 eck$LassoCheckResult]: Loop: 228#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 229#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 251#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 228#L509-10 [2019-11-19 22:20:59,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:59,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1806906284, now seen corresponding path program 1 times [2019-11-19 22:20:59,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:59,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137876612] [2019-11-19 22:20:59,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:20:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:20:59,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137876612] [2019-11-19 22:20:59,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:20:59,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:20:59,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705051779] [2019-11-19 22:20:59,185 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:20:59,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:59,186 INFO L82 PathProgramCache]: Analyzing trace with hash 72652, now seen corresponding path program 1 times [2019-11-19 22:20:59,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:59,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094234997] [2019-11-19 22:20:59,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:59,203 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:59,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:20:59,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:20:59,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:20:59,257 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-11-19 22:20:59,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:20:59,282 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2019-11-19 22:20:59,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:20:59,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2019-11-19 22:20:59,284 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-19 22:20:59,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 36 transitions. [2019-11-19 22:20:59,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-19 22:20:59,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-11-19 22:20:59,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2019-11-19 22:20:59,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:20:59,286 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-19 22:20:59,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2019-11-19 22:20:59,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-19 22:20:59,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-19 22:20:59,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-11-19 22:20:59,289 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-19 22:20:59,289 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-19 22:20:59,290 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 22:20:59,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2019-11-19 22:20:59,291 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-19 22:20:59,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:20:59,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:20:59,292 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:20:59,292 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:20:59,292 INFO L794 eck$LassoCheckResult]: Stem: 324#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 302#L-1 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; 303#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 311#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);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;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; 318#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 319#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 321#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 323#L509-5 strlen_#res := strlen_~i~0; 308#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;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; 309#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 305#L509-10 [2019-11-19 22:20:59,292 INFO L796 eck$LassoCheckResult]: Loop: 305#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 310#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 304#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 305#L509-10 [2019-11-19 22:20:59,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:59,293 INFO L82 PathProgramCache]: Analyzing trace with hash 764823385, now seen corresponding path program 1 times [2019-11-19 22:20:59,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:59,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183806484] [2019-11-19 22:20:59,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:59,335 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:59,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:59,336 INFO L82 PathProgramCache]: Analyzing trace with hash 72652, now seen corresponding path program 2 times [2019-11-19 22:20:59,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:59,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931015682] [2019-11-19 22:20:59,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:59,358 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:20:59,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:20:59,360 INFO L82 PathProgramCache]: Analyzing trace with hash 52000116, now seen corresponding path program 1 times [2019-11-19 22:20:59,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:20:59,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415658179] [2019-11-19 22:20:59,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:20:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:20:59,444 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:00,026 WARN L191 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 115 [2019-11-19 22:21:00,179 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-19 22:21:00,181 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:21:00,182 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:21:00,182 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:21:00,182 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:21:00,182 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:21:00,182 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:00,182 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:21:00,183 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:21:00,183 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration3_Lasso [2019-11-19 22:21:00,183 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:21:00,183 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:21:00,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,534 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-19 22:21:00,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:00,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:01,248 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:21:01,249 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:01,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:01,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:01,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:01,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:01,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:01,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:01,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:01,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:01,291 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:01,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:01,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:01,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:01,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:01,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:01,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:01,314 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:01,314 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:01,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:01,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:01,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:01,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:01,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:01,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:01,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:01,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:01,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:01,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:01,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:01,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:01,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:01,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:01,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:01,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:01,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:01,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:01,346 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:01,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:01,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:01,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:01,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:01,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:01,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:01,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:01,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:01,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:01,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:01,376 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:01,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:01,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:01,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:01,377 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:01,377 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:01,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:01,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:01,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:01,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:01,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:01,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:01,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:01,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:01,392 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:01,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:01,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:01,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:01,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:01,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:01,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:01,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:01,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:01,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:01,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:01,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:01,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:01,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:01,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:01,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:01,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:01,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:01,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:01,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:01,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:01,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:01,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:01,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:01,468 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:01,468 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:01,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:01,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:01,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:01,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:01,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:01,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:01,486 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:01,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:01,492 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:01,502 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:01,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:01,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:01,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:01,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:01,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:01,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:01,546 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:21:01,596 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-19 22:21:01,596 INFO L444 ModelExtractionUtils]: 38 out of 49 variables were initially zero. Simplification set additionally 8 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:01,600 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:21:01,602 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 22:21:01,602 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:21:01,602 INFO L512 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 [] [2019-11-19 22:21:01,642 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2019-11-19 22:21:01,644 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 22:21:01,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:01,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:21:01,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:01,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:21:01,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:01,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:01,750 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 [2019-11-19 22:21:01,750 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 36 transitions. cyclomatic complexity: 10 Second operand 6 states. [2019-11-19 22:21:01,873 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 36 transitions. cyclomatic complexity: 10. Second operand 6 states. Result 57 states and 72 transitions. Complement of second has 7 states. [2019-11-19 22:21:01,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-19 22:21:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-19 22:21:01,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2019-11-19 22:21:01,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-19 22:21:01,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:01,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 13 letters. Loop has 3 letters. [2019-11-19 22:21:01,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:01,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-19 22:21:01,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:01,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 72 transitions. [2019-11-19 22:21:01,880 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-19 22:21:01,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 43 states and 54 transitions. [2019-11-19 22:21:01,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-19 22:21:01,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-11-19 22:21:01,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2019-11-19 22:21:01,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:01,886 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-11-19 22:21:01,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2019-11-19 22:21:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-11-19 22:21:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-19 22:21:01,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2019-11-19 22:21:01,892 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-11-19 22:21:01,892 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-11-19 22:21:01,892 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 22:21:01,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2019-11-19 22:21:01,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-19 22:21:01,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:01,894 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:01,895 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:01,895 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 22:21:01,895 INFO L794 eck$LassoCheckResult]: Stem: 534#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 514#L-1 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; 515#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 523#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);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;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; 528#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 529#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 531#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 533#L509-5 strlen_#res := strlen_~i~0; 516#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;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; 517#L508-2 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 521#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 522#L529 assume !(0 == strstr_~nl~0 % 4294967296); 524#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 525#L531-3 [2019-11-19 22:21:01,895 INFO L796 eck$LassoCheckResult]: Loop: 525#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 512#L532 assume !strstr_#t~short17; 513#L532-2 assume !strstr_#t~short17;havoc strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 527#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 525#L531-3 [2019-11-19 22:21:01,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:01,896 INFO L82 PathProgramCache]: Analyzing trace with hash 51953446, now seen corresponding path program 1 times [2019-11-19 22:21:01,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:01,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542765247] [2019-11-19 22:21:01,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:01,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542765247] [2019-11-19 22:21:01,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:21:01,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:21:01,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861009027] [2019-11-19 22:21:01,990 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:21:01,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:01,990 INFO L82 PathProgramCache]: Analyzing trace with hash 3227613, now seen corresponding path program 1 times [2019-11-19 22:21:01,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:01,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126215449] [2019-11-19 22:21:01,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:02,017 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:02,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:02,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:21:02,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:21:02,143 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-19 22:21:02,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:02,191 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2019-11-19 22:21:02,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:21:02,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2019-11-19 22:21:02,194 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-19 22:21:02,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 38 transitions. [2019-11-19 22:21:02,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-19 22:21:02,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-19 22:21:02,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2019-11-19 22:21:02,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:02,195 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-19 22:21:02,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2019-11-19 22:21:02,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-19 22:21:02,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-19 22:21:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-11-19 22:21:02,198 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-19 22:21:02,198 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-11-19 22:21:02,198 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-19 22:21:02,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2019-11-19 22:21:02,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-19 22:21:02,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:02,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:02,200 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:02,200 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 22:21:02,200 INFO L794 eck$LassoCheckResult]: Stem: 606#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 582#L-1 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; 583#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 593#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);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;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; 600#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 601#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 603#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 605#L509-5 strlen_#res := strlen_~i~0; 588#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;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; 589#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 590#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 592#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 596#L509-11 strlen_#res := strlen_~i~0; 594#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 595#L529 assume !(0 == strstr_~nl~0 % 4294967296); 597#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 598#L531-3 [2019-11-19 22:21:02,200 INFO L796 eck$LassoCheckResult]: Loop: 598#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 586#L532 assume !strstr_#t~short17; 587#L532-2 assume !strstr_#t~short17;havoc strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 599#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 598#L531-3 [2019-11-19 22:21:02,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:02,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1349410205, now seen corresponding path program 1 times [2019-11-19 22:21:02,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:02,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459447237] [2019-11-19 22:21:02,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:02,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:02,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459447237] [2019-11-19 22:21:02,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:21:02,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:21:02,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437429988] [2019-11-19 22:21:02,270 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:21:02,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:02,271 INFO L82 PathProgramCache]: Analyzing trace with hash 3227613, now seen corresponding path program 2 times [2019-11-19 22:21:02,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:02,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713850356] [2019-11-19 22:21:02,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:02,296 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:02,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:02,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:21:02,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:21:02,411 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-19 22:21:02,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:02,482 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2019-11-19 22:21:02,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 22:21:02,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 74 transitions. [2019-11-19 22:21:02,486 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-19 22:21:02,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 47 states and 56 transitions. [2019-11-19 22:21:02,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2019-11-19 22:21:02,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-11-19 22:21:02,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 56 transitions. [2019-11-19 22:21:02,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:02,488 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 56 transitions. [2019-11-19 22:21:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 56 transitions. [2019-11-19 22:21:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2019-11-19 22:21:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-19 22:21:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-11-19 22:21:02,490 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-11-19 22:21:02,490 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-11-19 22:21:02,490 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-19 22:21:02,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2019-11-19 22:21:02,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-19 22:21:02,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:02,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:02,492 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:02,492 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 22:21:02,492 INFO L794 eck$LassoCheckResult]: Stem: 715#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 695#L-1 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);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 704#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);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;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; 709#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 710#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 711#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 716#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 712#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 713#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 714#L509-5 strlen_#res := strlen_~i~0; 697#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;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; 698#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 699#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 700#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 705#L509-11 strlen_#res := strlen_~i~0; 702#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 703#L529 assume !(0 == strstr_~nl~0 % 4294967296); 706#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 707#L531-3 [2019-11-19 22:21:02,492 INFO L796 eck$LassoCheckResult]: Loop: 707#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 693#L532 assume !strstr_#t~short17; 694#L532-2 assume !strstr_#t~short17;havoc strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 708#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 707#L531-3 [2019-11-19 22:21:02,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:02,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1796108770, now seen corresponding path program 1 times [2019-11-19 22:21:02,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:02,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206058443] [2019-11-19 22:21:02,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:21:02,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206058443] [2019-11-19 22:21:02,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:21:02,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:21:02,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373089906] [2019-11-19 22:21:02,561 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:21:02,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:02,561 INFO L82 PathProgramCache]: Analyzing trace with hash 3227613, now seen corresponding path program 3 times [2019-11-19 22:21:02,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:02,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018333292] [2019-11-19 22:21:02,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:02,572 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:02,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:02,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:21:02,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:21:02,675 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-11-19 22:21:02,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:02,729 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-11-19 22:21:02,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:21:02,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 43 transitions. [2019-11-19 22:21:02,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-19 22:21:02,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 33 states and 38 transitions. [2019-11-19 22:21:02,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-19 22:21:02,732 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-19 22:21:02,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 38 transitions. [2019-11-19 22:21:02,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:02,732 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-11-19 22:21:02,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 38 transitions. [2019-11-19 22:21:02,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-11-19 22:21:02,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-19 22:21:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-11-19 22:21:02,734 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-11-19 22:21:02,734 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-11-19 22:21:02,735 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-19 22:21:02,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2019-11-19 22:21:02,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-19 22:21:02,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:02,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:02,736 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:02,736 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 22:21:02,736 INFO L794 eck$LassoCheckResult]: Stem: 799#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 775#L-1 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; 776#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 786#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);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;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; 793#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 794#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 795#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 800#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 796#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 797#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 798#L509-5 strlen_#res := strlen_~i~0; 781#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;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; 782#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 783#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 784#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 777#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 778#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 785#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 789#L509-11 strlen_#res := strlen_~i~0; 787#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 788#L529 assume !(0 == strstr_~nl~0 % 4294967296); 790#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 791#L531-3 [2019-11-19 22:21:02,737 INFO L796 eck$LassoCheckResult]: Loop: 791#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 779#L532 assume !strstr_#t~short17; 780#L532-2 assume !strstr_#t~short17;havoc strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 792#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 791#L531-3 [2019-11-19 22:21:02,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:02,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1624521053, now seen corresponding path program 1 times [2019-11-19 22:21:02,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:02,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737424284] [2019-11-19 22:21:02,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:02,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:02,782 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:02,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:02,783 INFO L82 PathProgramCache]: Analyzing trace with hash 3227613, now seen corresponding path program 4 times [2019-11-19 22:21:02,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:02,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881842984] [2019-11-19 22:21:02,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:02,796 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:02,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:02,796 INFO L82 PathProgramCache]: Analyzing trace with hash 16049535, now seen corresponding path program 1 times [2019-11-19 22:21:02,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:02,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072337813] [2019-11-19 22:21:02,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:02,893 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:03,882 WARN L191 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 159 [2019-11-19 22:21:04,128 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-11-19 22:21:04,132 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:21:04,133 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:21:04,133 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:21:04,133 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:21:04,133 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:21:04,133 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:04,134 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:21:04,134 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:21:04,134 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration7_Lasso [2019-11-19 22:21:04,134 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:21:04,134 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:21:04,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:04,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:04,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:04,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:04,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:04,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:04,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:04,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:04,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:04,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:04,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:04,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:04,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:04,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:04,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:04,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:04,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:04,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:04,846 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2019-11-19 22:21:05,010 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-11-19 22:21:05,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:05,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:05,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:05,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:05,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:05,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:05,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:05,450 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-19 22:21:05,884 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:21:05,884 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:05,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:05,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:05,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:05,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:05,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:05,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:05,897 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:05,897 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:05,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:05,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:05,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:05,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:05,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:05,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:05,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:05,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:05,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:05,912 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:05,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:05,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:05,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:05,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:05,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:05,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:05,922 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:05,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:05,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:05,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:05,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:05,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:05,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:05,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:05,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:05,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:05,939 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:05,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:05,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:05,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:05,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:05,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:05,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:05,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:05,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:05,950 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:05,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:05,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:05,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:05,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:05,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:05,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:05,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:05,959 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:05,960 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:05,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:05,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:05,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:05,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:05,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:05,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:05,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:05,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:05,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:05,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:05,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:05,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:05,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:05,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:05,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:05,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:05,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:05,984 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:05,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:05,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:05,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:05,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:05,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:05,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:05,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:05,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:05,995 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:06,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:06,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:06,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:06,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:06,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:06,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:06,002 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:06,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:06,004 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:06,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:06,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:06,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:06,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:06,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:06,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:06,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:06,034 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:06,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:06,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:06,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:06,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:06,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:06,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:06,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:06,052 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:06,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:06,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:06,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:06,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:06,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:06,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:06,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:06,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:06,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:06,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:06,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:06,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:06,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:06,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:06,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:06,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:06,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:06,095 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:06,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:06,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:06,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:06,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:06,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:06,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:06,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:06,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:06,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:06,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:06,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:06,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:06,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:06,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:06,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:06,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:06,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:06,126 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:06,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:06,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:06,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:06,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:06,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:06,140 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:06,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:06,144 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:06,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:06,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:06,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:06,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:06,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:06,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:06,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:06,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:06,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:06,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:06,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:06,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:06,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:06,173 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:06,173 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:06,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:06,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:06,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:06,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:06,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:06,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:06,202 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:06,202 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:06,223 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:06,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:06,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:06,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:06,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:06,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:06,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:06,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:06,240 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:06,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:06,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:06,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:06,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:06,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:06,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:06,253 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:06,262 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:06,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:06,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:06,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:06,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:06,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:06,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:06,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:06,279 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:06,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:06,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:06,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:06,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:06,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:06,294 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:06,294 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:06,298 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:06,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:06,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:06,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:06,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:06,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:06,315 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:06,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:06,322 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:06,328 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:06,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:06,330 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-19 22:21:06,330 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-19 22:21:06,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:06,339 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2019-11-19 22:21:06,339 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-19 22:21:06,362 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:06,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:06,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:06,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:06,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:06,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:06,385 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:06,385 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:06,410 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:21:06,476 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2019-11-19 22:21:06,476 INFO L444 ModelExtractionUtils]: 26 out of 52 variables were initially zero. Simplification set additionally 23 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:06,481 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:21:06,483 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 22:21:06,484 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:21:06,484 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strstr_~haystack.offset, v_rep(select #length ULTIMATE.start_main_~hay~0.base)_1) = -1*ULTIMATE.start_strstr_~haystack.offset + 1*v_rep(select #length ULTIMATE.start_main_~hay~0.base)_1 Supporting invariants [] [2019-11-19 22:21:06,620 INFO L297 tatePredicateManager]: 29 out of 31 supporting invariants were superfluous and have been removed [2019-11-19 22:21:06,625 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 22:21:06,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:06,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:21:06,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:06,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:21:06,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:06,756 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 [2019-11-19 22:21:06,756 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-19 22:21:06,811 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 41 states and 51 transitions. Complement of second has 8 states. [2019-11-19 22:21:06,812 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 [2019-11-19 22:21:06,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-19 22:21:06,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2019-11-19 22:21:06,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 22 letters. Loop has 4 letters. [2019-11-19 22:21:06,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:06,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 26 letters. Loop has 4 letters. [2019-11-19 22:21:06,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:06,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 22 letters. Loop has 8 letters. [2019-11-19 22:21:06,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:06,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2019-11-19 22:21:06,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:21:06,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 38 states and 45 transitions. [2019-11-19 22:21:06,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-19 22:21:06,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-19 22:21:06,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 45 transitions. [2019-11-19 22:21:06,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:06,817 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-11-19 22:21:06,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 45 transitions. [2019-11-19 22:21:06,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-11-19 22:21:06,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-19 22:21:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-11-19 22:21:06,820 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-11-19 22:21:06,820 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-11-19 22:21:06,821 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-19 22:21:06,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 44 transitions. [2019-11-19 22:21:06,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:21:06,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:06,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:06,823 INFO L849 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] [2019-11-19 22:21:06,823 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:21:06,823 INFO L794 eck$LassoCheckResult]: Stem: 1111#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1091#L-1 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; 1092#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 1098#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);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;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; 1105#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1106#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1107#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 1112#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 1108#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1109#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1110#L509-5 strlen_#res := strlen_~i~0; 1093#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;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; 1094#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1095#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1096#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 1086#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 1087#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1097#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1101#L509-11 strlen_#res := strlen_~i~0; 1099#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 1100#L529 assume !(0 == strstr_~nl~0 % 4294967296); 1102#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 1103#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 1088#L532 assume strstr_#t~short17;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 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 1083#L517-3 [2019-11-19 22:21:06,824 INFO L796 eck$LassoCheckResult]: Loop: 1083#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 1078#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 1079#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem8;havoc memcmp_#t~mem7;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 1083#L517-3 [2019-11-19 22:21:06,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:06,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2091601114, now seen corresponding path program 1 times [2019-11-19 22:21:06,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:06,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788376250] [2019-11-19 22:21:06,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:06,872 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:06,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:06,873 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 1 times [2019-11-19 22:21:06,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:06,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481438397] [2019-11-19 22:21:06,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:06,895 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:06,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:06,897 INFO L82 PathProgramCache]: Analyzing trace with hash 496824785, now seen corresponding path program 1 times [2019-11-19 22:21:06,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:06,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413971662] [2019-11-19 22:21:06,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:06,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:07,011 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:08,344 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 270 DAG size of output: 195 [2019-11-19 22:21:08,681 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 145 [2019-11-19 22:21:08,684 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:21:08,684 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:21:08,684 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:21:08,684 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:21:08,684 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:21:08,684 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:08,684 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:21:08,684 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:21:08,684 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration8_Lasso [2019-11-19 22:21:08,684 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:21:08,685 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:21:08,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:08,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:09,739 WARN L191 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 121 [2019-11-19 22:21:10,083 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-11-19 22:21:10,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:10,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:10,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:10,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:10,640 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-19 22:21:11,231 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-19 22:21:11,311 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:21:11,311 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:11,327 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:11,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:11,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,356 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:11,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:11,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:11,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:11,386 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:11,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:11,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:11,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:11,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:11,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:11,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:11,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,466 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:11,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:11,479 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,482 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:11,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:11,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:11,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:11,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:11,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,536 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:11,538 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:11,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,555 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,555 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:11,556 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:11,565 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:11,576 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:11,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:11,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:11,602 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,610 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:11,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,619 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:11,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,620 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:11,620 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:11,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:11,639 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:11,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,665 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:11,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:11,668 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:11,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:11,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:11,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:11,695 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,703 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-19 22:21:11,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,707 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-19 22:21:11,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:11,723 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,731 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:11,731 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:11,734 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:11,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:11,755 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:11,764 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:11,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:11,780 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:11,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:11,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:11,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:11,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:11,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:11,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:11,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:11,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:11,826 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:11,826 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:11,861 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:21:12,009 INFO L443 ModelExtractionUtils]: Simplification made 28 calls to the SMT solver. [2019-11-19 22:21:12,010 INFO L444 ModelExtractionUtils]: 39 out of 73 variables were initially zero. Simplification set additionally 31 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:12,017 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:12,020 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 22:21:12,021 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:21:12,021 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_memcmp_~s~0.offset, v_rep(select #length ULTIMATE.start_strstr_~haystack.base)_2) = -1*ULTIMATE.start_memcmp_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_strstr_~haystack.base)_2 Supporting invariants [] [2019-11-19 22:21:12,349 INFO L297 tatePredicateManager]: 42 out of 45 supporting invariants were superfluous and have been removed [2019-11-19 22:21:12,355 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 22:21:12,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:12,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-19 22:21:12,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:12,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-19 22:21:12,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:12,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:12,535 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 [2019-11-19 22:21:12,535 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 44 transitions. cyclomatic complexity: 11 Second operand 6 states. [2019-11-19 22:21:12,673 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 44 transitions. cyclomatic complexity: 11. Second operand 6 states. Result 90 states and 109 transitions. Complement of second has 10 states. [2019-11-19 22:21:12,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 2 non-accepting loop states 2 accepting loop states [2019-11-19 22:21:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-19 22:21:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2019-11-19 22:21:12,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 45 transitions. Stem has 24 letters. Loop has 3 letters. [2019-11-19 22:21:12,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:12,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 45 transitions. Stem has 27 letters. Loop has 3 letters. [2019-11-19 22:21:12,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:12,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 45 transitions. Stem has 24 letters. Loop has 6 letters. [2019-11-19 22:21:12,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:12,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 109 transitions. [2019-11-19 22:21:12,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:21:12,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 68 states and 83 transitions. [2019-11-19 22:21:12,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-19 22:21:12,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-19 22:21:12,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 83 transitions. [2019-11-19 22:21:12,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:12,681 INFO L688 BuchiCegarLoop]: Abstraction has 68 states and 83 transitions. [2019-11-19 22:21:12,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 83 transitions. [2019-11-19 22:21:12,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 43. [2019-11-19 22:21:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-19 22:21:12,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-11-19 22:21:12,688 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-11-19 22:21:12,688 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-11-19 22:21:12,688 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-19 22:21:12,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2019-11-19 22:21:12,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:21:12,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:12,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:12,690 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:12,690 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:21:12,690 INFO L794 eck$LassoCheckResult]: Stem: 1541#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1521#L-1 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; 1522#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 1530#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);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;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; 1535#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1536#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1537#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 1542#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 1538#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1539#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1540#L509-5 strlen_#res := strlen_~i~0; 1523#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;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; 1524#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1525#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1526#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 1516#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 1517#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1527#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1531#L509-11 strlen_#res := strlen_~i~0; 1528#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 1529#L529 assume !(0 == strstr_~nl~0 % 4294967296); 1532#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 1533#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 1549#L532 assume !strstr_#t~short17; 1520#L532-2 assume !strstr_#t~short17;havoc strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 1534#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 1544#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 1518#L532 assume strstr_#t~short17;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 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 1511#L517-3 [2019-11-19 22:21:12,690 INFO L796 eck$LassoCheckResult]: Loop: 1511#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 1507#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 1508#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem8;havoc memcmp_#t~mem7;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 1511#L517-3 [2019-11-19 22:21:12,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:12,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1756263678, now seen corresponding path program 1 times [2019-11-19 22:21:12,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:12,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808299088] [2019-11-19 22:21:12,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:12,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:12,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808299088] [2019-11-19 22:21:12,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169116456] [2019-11-19 22:21:12,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:21:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:12,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 55 conjunts are in the unsatisfiable core [2019-11-19 22:21:12,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:12,990 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-19 22:21:12,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:21:12,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:21:13,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:21:13,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:20 [2019-11-19 22:21:13,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:21:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:13,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:21:13,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2019-11-19 22:21:13,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930710043] [2019-11-19 22:21:13,422 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:21:13,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:13,422 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 2 times [2019-11-19 22:21:13,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:13,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508607055] [2019-11-19 22:21:13,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:13,434 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:13,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:13,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 22:21:13,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2019-11-19 22:21:13,535 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. cyclomatic complexity: 14 Second operand 22 states. [2019-11-19 22:21:16,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:16,049 INFO L93 Difference]: Finished difference Result 157 states and 186 transitions. [2019-11-19 22:21:16,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-19 22:21:16,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 186 transitions. [2019-11-19 22:21:16,051 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-19 22:21:16,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 136 states and 162 transitions. [2019-11-19 22:21:16,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2019-11-19 22:21:16,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2019-11-19 22:21:16,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 162 transitions. [2019-11-19 22:21:16,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:16,053 INFO L688 BuchiCegarLoop]: Abstraction has 136 states and 162 transitions. [2019-11-19 22:21:16,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 162 transitions. [2019-11-19 22:21:16,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 75. [2019-11-19 22:21:16,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-19 22:21:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2019-11-19 22:21:16,059 INFO L711 BuchiCegarLoop]: Abstraction has 75 states and 89 transitions. [2019-11-19 22:21:16,059 INFO L591 BuchiCegarLoop]: Abstraction has 75 states and 89 transitions. [2019-11-19 22:21:16,059 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-19 22:21:16,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 89 transitions. [2019-11-19 22:21:16,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:21:16,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:16,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:16,061 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:16,061 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:21:16,061 INFO L794 eck$LassoCheckResult]: Stem: 1931#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1903#L-1 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; 1904#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 1912#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);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;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; 1919#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1920#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1923#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 1962#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 1961#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1960#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1959#L509-5 strlen_#res := strlen_~i~0; 1907#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;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; 1908#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1909#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1910#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 1905#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 1906#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1911#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 1930#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 1940#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1929#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1916#L509-11 strlen_#res := strlen_~i~0; 1913#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 1914#L529 assume !(0 == strstr_~nl~0 % 4294967296); 1917#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 1918#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 1936#L532 assume !strstr_#t~short17; 1902#L532-2 assume !strstr_#t~short17;havoc strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 1915#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 1939#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 1900#L532 assume strstr_#t~short17;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 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 1895#L517-3 [2019-11-19 22:21:16,061 INFO L796 eck$LassoCheckResult]: Loop: 1895#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 1891#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 1892#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem8;havoc memcmp_#t~mem7;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 1895#L517-3 [2019-11-19 22:21:16,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:16,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1765677085, now seen corresponding path program 2 times [2019-11-19 22:21:16,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:16,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212907971] [2019-11-19 22:21:16,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:16,112 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:16,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:16,113 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 3 times [2019-11-19 22:21:16,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:16,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212507115] [2019-11-19 22:21:16,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:16,122 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:16,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:16,123 INFO L82 PathProgramCache]: Analyzing trace with hash 821646714, now seen corresponding path program 1 times [2019-11-19 22:21:16,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:16,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273213150] [2019-11-19 22:21:16,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:16,177 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:18,090 WARN L191 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 318 DAG size of output: 233 [2019-11-19 22:21:18,457 WARN L191 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-11-19 22:21:18,461 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:21:18,461 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:21:18,462 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:21:18,462 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:21:18,462 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:21:18,462 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:18,462 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:21:18,462 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:21:18,462 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration10_Lasso [2019-11-19 22:21:18,462 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:21:18,462 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:21:18,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:18,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:18,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:18,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:18,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:18,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:18,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:18,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:18,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:18,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:18,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:18,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:18,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:18,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:18,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:18,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:18,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:18,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:18,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:18,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:19,820 WARN L191 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 129 [2019-11-19 22:21:20,222 WARN L191 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 89 [2019-11-19 22:21:20,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:20,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:20,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:20,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:20,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:20,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:20,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:20,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:20,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:20,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:20,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:20,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:20,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:20,945 WARN L191 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-11-19 22:21:21,818 WARN L191 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-19 22:21:21,992 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-19 22:21:22,150 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:21:22,150 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:22,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:22,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:22,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,166 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:22,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:22,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:22,169 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 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 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:22,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:22,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:22,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 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 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:22,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:22,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:22,185 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 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 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:22,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:22,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:22,193 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 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 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:22,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:22,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:22,202 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 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 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:22,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:22,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:22,209 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 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 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:22,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:22,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:22,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 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 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:22,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:22,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:22,228 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 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 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:22,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:22,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:22,237 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 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 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:22,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:22,261 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 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 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:22,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:22,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:22,269 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 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 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:22,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:22,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:22,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 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 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:22,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:22,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:22,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 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 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:22,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:22,298 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 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 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:22,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:22,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:22,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 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 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:22,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:22,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:22,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:22,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:22,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:22,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 109 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 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 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:22,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:22,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:21:22,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 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 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:22,348 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:22,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 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 112 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,358 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:22,358 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:22,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 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 113 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,379 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:22,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:22,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 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 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,404 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,405 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:22,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:22,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 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 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,416 INFO L203 nArgumentSynthesizer]: 6 stem disjuncts [2019-11-19 22:21:22,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,429 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-11-19 22:21:22,430 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:22,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:22,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:22,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:22,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:22,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:22,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:22,488 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:22,488 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 116 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,529 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:21:22,649 INFO L443 ModelExtractionUtils]: Simplification made 28 calls to the SMT solver. [2019-11-19 22:21:22,649 INFO L444 ModelExtractionUtils]: 35 out of 76 variables were initially zero. Simplification set additionally 38 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:22,655 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 117 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:22,659 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 22:21:22,659 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:21:22,659 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_memcmp_~d~0.offset, v_rep(select #length ULTIMATE.start_strlen_~s.base)_3) = -1*ULTIMATE.start_memcmp_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_strlen_~s.base)_3 Supporting invariants [] [2019-11-19 22:21:23,122 INFO L297 tatePredicateManager]: 75 out of 77 supporting invariants were superfluous and have been removed [2019-11-19 22:21:23,125 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 22:21:23,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:23,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-19 22:21:23,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:23,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:21:23,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:23,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:23,235 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-19 22:21:23,235 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 75 states and 89 transitions. cyclomatic complexity: 20 Second operand 5 states. [2019-11-19 22:21:23,308 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 75 states and 89 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 150 states and 179 transitions. Complement of second has 8 states. [2019-11-19 22:21:23,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-19 22:21:23,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-19 22:21:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2019-11-19 22:21:23,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 31 letters. Loop has 3 letters. [2019-11-19 22:21:23,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:23,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 34 letters. Loop has 3 letters. [2019-11-19 22:21:23,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:23,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 31 letters. Loop has 6 letters. [2019-11-19 22:21:23,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:23,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 179 transitions. [2019-11-19 22:21:23,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:21:23,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 108 states and 129 transitions. [2019-11-19 22:21:23,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-11-19 22:21:23,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-11-19 22:21:23,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 129 transitions. [2019-11-19 22:21:23,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:23,317 INFO L688 BuchiCegarLoop]: Abstraction has 108 states and 129 transitions. [2019-11-19 22:21:23,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 129 transitions. [2019-11-19 22:21:23,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 82. [2019-11-19 22:21:23,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-19 22:21:23,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2019-11-19 22:21:23,322 INFO L711 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2019-11-19 22:21:23,322 INFO L591 BuchiCegarLoop]: Abstraction has 82 states and 96 transitions. [2019-11-19 22:21:23,322 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-19 22:21:23,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 96 transitions. [2019-11-19 22:21:23,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:21:23,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:23,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:23,324 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 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] [2019-11-19 22:21:23,324 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:21:23,324 INFO L794 eck$LassoCheckResult]: Stem: 2602#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2567#L-1 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; 2568#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 2579#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);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;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; 2588#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 2589#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2592#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 2605#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 2593#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2595#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 2596#L509-5 strlen_#res := strlen_~i~0; 2597#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;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; 2590#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 2591#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2620#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 2569#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 2570#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2578#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 2600#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 2616#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2617#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 2582#L509-11 strlen_#res := strlen_~i~0; 2583#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 2606#L529 assume !(0 == strstr_~nl~0 % 4294967296); 2607#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 2610#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 2611#L532 assume strstr_#t~short17;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 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 2563#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2564#L517-1 assume !(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6; 2565#L517-4 memcmp_#res := 0; 2566#L523 strstr_#t~ret16 := memcmp_#res;strstr_#t~short17 := 0 == strstr_#t~ret16; 2625#L532-2 assume !strstr_#t~short17;havoc strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 2624#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 2621#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 2571#L532 assume strstr_#t~short17;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 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 2562#L517-3 [2019-11-19 22:21:23,325 INFO L796 eck$LassoCheckResult]: Loop: 2562#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2558#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 2559#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem8;havoc memcmp_#t~mem7;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 2562#L517-3 [2019-11-19 22:21:23,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:23,325 INFO L82 PathProgramCache]: Analyzing trace with hash 191871499, now seen corresponding path program 1 times [2019-11-19 22:21:23,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:23,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510124838] [2019-11-19 22:21:23,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:23,360 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-19 22:21:23,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510124838] [2019-11-19 22:21:23,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:21:23,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:21:23,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602401180] [2019-11-19 22:21:23,361 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:21:23,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:23,362 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 4 times [2019-11-19 22:21:23,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:23,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616980061] [2019-11-19 22:21:23,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:23,372 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:23,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:23,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:21:23,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:21:23,475 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. cyclomatic complexity: 21 Second operand 4 states. [2019-11-19 22:21:23,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:23,498 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2019-11-19 22:21:23,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:21:23,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 98 transitions. [2019-11-19 22:21:23,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:21:23,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 80 states and 91 transitions. [2019-11-19 22:21:23,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-19 22:21:23,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-19 22:21:23,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 91 transitions. [2019-11-19 22:21:23,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:23,500 INFO L688 BuchiCegarLoop]: Abstraction has 80 states and 91 transitions. [2019-11-19 22:21:23,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 91 transitions. [2019-11-19 22:21:23,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-19 22:21:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-19 22:21:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2019-11-19 22:21:23,505 INFO L711 BuchiCegarLoop]: Abstraction has 80 states and 91 transitions. [2019-11-19 22:21:23,505 INFO L591 BuchiCegarLoop]: Abstraction has 80 states and 91 transitions. [2019-11-19 22:21:23,505 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-19 22:21:23,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 91 transitions. [2019-11-19 22:21:23,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:21:23,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:23,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:23,507 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 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] [2019-11-19 22:21:23,507 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:21:23,508 INFO L794 eck$LassoCheckResult]: Stem: 2775#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2746#L-1 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; 2747#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 2755#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);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;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; 2764#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 2765#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2766#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 2814#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 2813#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2812#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 2811#L509-5 strlen_#res := strlen_~i~0; 2810#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;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; 2809#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 2807#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2772#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 2748#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 2749#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2754#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 2801#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 2800#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2798#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 2797#L509-11 strlen_#res := strlen_~i~0; 2756#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 2757#L529 assume !(0 == strstr_~nl~0 % 4294967296); 2778#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 2780#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 2781#L532 assume strstr_#t~short17;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 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 2779#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2789#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 2788#L518 assume 0 != memcmp_~r~0;havoc memcmp_#t~mem8;havoc memcmp_#t~mem7;memcmp_#res := memcmp_~r~0; 2786#L523 strstr_#t~ret16 := memcmp_#res;strstr_#t~short17 := 0 == strstr_#t~ret16; 2785#L532-2 assume !strstr_#t~short17;havoc strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 2783#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 2782#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 2743#L532 assume strstr_#t~short17;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 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 2739#L517-3 [2019-11-19 22:21:23,508 INFO L796 eck$LassoCheckResult]: Loop: 2739#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2735#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 2736#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem8;havoc memcmp_#t~mem7;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 2739#L517-3 [2019-11-19 22:21:23,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:23,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1795103955, now seen corresponding path program 1 times [2019-11-19 22:21:23,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:23,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254980336] [2019-11-19 22:21:23,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-19 22:21:23,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254980336] [2019-11-19 22:21:23,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:21:23,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:21:23,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933564212] [2019-11-19 22:21:23,642 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:21:23,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:23,643 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 5 times [2019-11-19 22:21:23,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:23,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797801038] [2019-11-19 22:21:23,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:23,656 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:23,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:23,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:21:23,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:21:23,746 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. cyclomatic complexity: 18 Second operand 5 states. [2019-11-19 22:21:23,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:23,840 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2019-11-19 22:21:23,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:21:23,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 108 transitions. [2019-11-19 22:21:23,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:21:23,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 93 states and 104 transitions. [2019-11-19 22:21:23,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-11-19 22:21:23,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-19 22:21:23,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 104 transitions. [2019-11-19 22:21:23,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:23,843 INFO L688 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2019-11-19 22:21:23,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 104 transitions. [2019-11-19 22:21:23,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2019-11-19 22:21:23,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-19 22:21:23,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2019-11-19 22:21:23,856 INFO L711 BuchiCegarLoop]: Abstraction has 85 states and 96 transitions. [2019-11-19 22:21:23,857 INFO L591 BuchiCegarLoop]: Abstraction has 85 states and 96 transitions. [2019-11-19 22:21:23,857 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-19 22:21:23,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 96 transitions. [2019-11-19 22:21:23,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:21:23,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:23,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:23,859 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 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] [2019-11-19 22:21:23,862 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:21:23,862 INFO L794 eck$LassoCheckResult]: Stem: 2962#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2930#L-1 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; 2931#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 2942#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);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;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; 2950#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 2951#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2953#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 2969#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 2954#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2956#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 2957#L509-5 strlen_#res := strlen_~i~0; 2958#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;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; 2952#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 2939#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2940#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 2932#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 2933#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2941#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 2983#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 2982#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2959#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 2945#L509-11 strlen_#res := strlen_~i~0; 2946#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 2964#L529 assume !(0 == strstr_~nl~0 % 4294967296); 2947#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 2948#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 2968#L532 assume strstr_#t~short17;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 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 2929#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2926#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 2927#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem8;havoc memcmp_#t~mem7;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 2995#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2994#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 2976#L518 assume 0 != memcmp_~r~0;havoc memcmp_#t~mem8;havoc memcmp_#t~mem7;memcmp_#res := memcmp_~r~0; 2974#L523 strstr_#t~ret16 := memcmp_#res;strstr_#t~short17 := 0 == strstr_#t~ret16; 2973#L532-2 assume !strstr_#t~short17;havoc strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 2971#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 2970#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 2934#L532 assume strstr_#t~short17;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 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 2928#L517-3 [2019-11-19 22:21:23,863 INFO L796 eck$LassoCheckResult]: Loop: 2928#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2924#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 2925#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem8;havoc memcmp_#t~mem7;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 2928#L517-3 [2019-11-19 22:21:23,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:23,863 INFO L82 PathProgramCache]: Analyzing trace with hash -2138077336, now seen corresponding path program 1 times [2019-11-19 22:21:23,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:23,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717044023] [2019-11-19 22:21:23,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:23,988 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-19 22:21:23,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717044023] [2019-11-19 22:21:23,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637083660] [2019-11-19 22:21:23,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:21:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:24,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-19 22:21:24,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:24,115 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-19 22:21:24,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:21:24,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-11-19 22:21:24,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232927266] [2019-11-19 22:21:24,117 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:21:24,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:24,118 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 6 times [2019-11-19 22:21:24,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:24,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680001589] [2019-11-19 22:21:24,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:24,130 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:24,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:24,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:21:24,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:21:24,217 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. cyclomatic complexity: 18 Second operand 10 states. [2019-11-19 22:21:24,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:24,406 INFO L93 Difference]: Finished difference Result 133 states and 150 transitions. [2019-11-19 22:21:24,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:21:24,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 150 transitions. [2019-11-19 22:21:24,407 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-19 22:21:24,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 105 states and 120 transitions. [2019-11-19 22:21:24,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-19 22:21:24,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-19 22:21:24,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 120 transitions. [2019-11-19 22:21:24,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:24,409 INFO L688 BuchiCegarLoop]: Abstraction has 105 states and 120 transitions. [2019-11-19 22:21:24,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 120 transitions. [2019-11-19 22:21:24,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2019-11-19 22:21:24,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-19 22:21:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-11-19 22:21:24,412 INFO L711 BuchiCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-11-19 22:21:24,412 INFO L591 BuchiCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-11-19 22:21:24,412 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-19 22:21:24,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 87 transitions. [2019-11-19 22:21:24,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:21:24,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:24,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:24,414 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:24,414 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:21:24,414 INFO L794 eck$LassoCheckResult]: Stem: 3318#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3285#L-1 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; 3286#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 3299#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);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;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; 3307#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 3308#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3309#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 3320#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3310#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3311#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 3332#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3331#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3319#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 3312#L509-5 strlen_#res := strlen_~i~0; 3292#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;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; 3293#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 3294#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3295#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 3287#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3288#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3297#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 3315#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3296#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3298#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 3302#L509-11 strlen_#res := strlen_~i~0; 3303#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 3321#L529 assume !(0 == strstr_~nl~0 % 4294967296); 3322#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 3327#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 3328#L532 assume strstr_#t~short17;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 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 3348#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 3347#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 3325#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem8;havoc memcmp_#t~mem7;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 3326#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 3280#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 3281#L518 assume 0 != memcmp_~r~0;havoc memcmp_#t~mem8;havoc memcmp_#t~mem7;memcmp_#res := memcmp_~r~0; 3336#L523 strstr_#t~ret16 := memcmp_#res;strstr_#t~short17 := 0 == strstr_#t~ret16; 3335#L532-2 assume !strstr_#t~short17;havoc strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 3334#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 3333#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 3289#L532 assume strstr_#t~short17;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 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 3282#L517-3 [2019-11-19 22:21:24,415 INFO L796 eck$LassoCheckResult]: Loop: 3282#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 3278#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 3279#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem8;havoc memcmp_#t~mem7;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 3282#L517-3 [2019-11-19 22:21:24,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:24,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1050158307, now seen corresponding path program 2 times [2019-11-19 22:21:24,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:24,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480199958] [2019-11-19 22:21:24,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 22:21:24,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480199958] [2019-11-19 22:21:24,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460619326] [2019-11-19 22:21:24,628 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:21:24,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:21:24,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:21:24,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-19 22:21:24,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 22:21:24,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:21:24,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2019-11-19 22:21:24,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934035719] [2019-11-19 22:21:24,868 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:21:24,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:24,869 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 7 times [2019-11-19 22:21:24,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:24,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342203894] [2019-11-19 22:21:24,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:24,878 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:24,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:24,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-19 22:21:24,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-11-19 22:21:24,965 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. cyclomatic complexity: 17 Second operand 19 states. [2019-11-19 22:21:25,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:25,276 INFO L93 Difference]: Finished difference Result 259 states and 296 transitions. [2019-11-19 22:21:25,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 22:21:25,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 259 states and 296 transitions. [2019-11-19 22:21:25,279 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2019-11-19 22:21:25,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 259 states to 238 states and 274 transitions. [2019-11-19 22:21:25,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2019-11-19 22:21:25,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-11-19 22:21:25,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 238 states and 274 transitions. [2019-11-19 22:21:25,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:25,282 INFO L688 BuchiCegarLoop]: Abstraction has 238 states and 274 transitions. [2019-11-19 22:21:25,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states and 274 transitions. [2019-11-19 22:21:25,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 91. [2019-11-19 22:21:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-19 22:21:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2019-11-19 22:21:25,289 INFO L711 BuchiCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-11-19 22:21:25,290 INFO L591 BuchiCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-11-19 22:21:25,290 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-19 22:21:25,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 103 transitions. [2019-11-19 22:21:25,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:21:25,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:25,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:25,293 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:21:25,294 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:21:25,294 INFO L794 eck$LassoCheckResult]: Stem: 3804#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3775#L-1 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; 3776#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 3787#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);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;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; 3792#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 3793#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3796#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 3815#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3797#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3798#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 3807#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3816#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3817#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 3799#L509-5 strlen_#res := strlen_~i~0; 3800#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;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; 3794#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 3795#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3829#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 3828#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 3826#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3827#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 3845#L509-11 strlen_#res := strlen_~i~0; 3844#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 3843#L529 assume !(0 == strstr_~nl~0 % 4294967296); 3842#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 3841#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 3839#L532 assume strstr_#t~short17;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 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 3838#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 3836#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 3837#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem8;havoc memcmp_#t~mem7;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 3835#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 3834#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 3833#L518 assume 0 != memcmp_~r~0;havoc memcmp_#t~mem8;havoc memcmp_#t~mem7;memcmp_#res := memcmp_~r~0; 3802#L523 strstr_#t~ret16 := memcmp_#res;strstr_#t~short17 := 0 == strstr_#t~ret16; 3803#L532-2 assume !strstr_#t~short17;havoc strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 3808#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 3809#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 3831#L532 assume !strstr_#t~short17; 3823#L532-2 assume !strstr_#t~short17;havoc strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 3822#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 3821#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 3772#L532 assume strstr_#t~short17;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 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 3770#L517-3 [2019-11-19 22:21:25,295 INFO L796 eck$LassoCheckResult]: Loop: 3770#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 3766#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 3767#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem8;havoc memcmp_#t~mem7;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 3770#L517-3 [2019-11-19 22:21:25,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:25,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1867103268, now seen corresponding path program 1 times [2019-11-19 22:21:25,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:25,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261204374] [2019-11-19 22:21:25,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-19 22:21:25,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261204374] [2019-11-19 22:21:25,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433738959] [2019-11-19 22:21:25,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:21:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:25,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-19 22:21:25,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:25,686 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-19 22:21:25,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:21:25,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2019-11-19 22:21:25,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342188971] [2019-11-19 22:21:25,687 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:21:25,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:25,688 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 8 times [2019-11-19 22:21:25,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:25,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609022056] [2019-11-19 22:21:25,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:25,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:25,696 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:25,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:21:25,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 22:21:25,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:21:25,780 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. cyclomatic complexity: 19 Second operand 16 states. [2019-11-19 22:21:26,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:21:26,101 INFO L93 Difference]: Finished difference Result 195 states and 223 transitions. [2019-11-19 22:21:26,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:21:26,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 223 transitions. [2019-11-19 22:21:26,103 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-11-19 22:21:26,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 190 states and 218 transitions. [2019-11-19 22:21:26,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2019-11-19 22:21:26,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2019-11-19 22:21:26,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 190 states and 218 transitions. [2019-11-19 22:21:26,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:21:26,106 INFO L688 BuchiCegarLoop]: Abstraction has 190 states and 218 transitions. [2019-11-19 22:21:26,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states and 218 transitions. [2019-11-19 22:21:26,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 91. [2019-11-19 22:21:26,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-19 22:21:26,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2019-11-19 22:21:26,112 INFO L711 BuchiCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-11-19 22:21:26,112 INFO L591 BuchiCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-11-19 22:21:26,112 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-19 22:21:26,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 102 transitions. [2019-11-19 22:21:26,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-19 22:21:26,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:21:26,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:21:26,114 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 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] [2019-11-19 22:21:26,114 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:21:26,115 INFO L794 eck$LassoCheckResult]: Stem: 4240#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 4211#L-1 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; 4212#L541 assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 4221#L545 assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);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;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; 4228#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 4229#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 4232#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 4248#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 4233#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 4234#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 4251#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 4252#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 4241#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 4242#L509-5 strlen_#res := strlen_~i~0; 4215#L510 strstr_#t~ret11 := strlen_#res;strstr_~nl~0 := strstr_#t~ret11;havoc strstr_#t~ret11;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; 4216#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 4217#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 4218#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 4276#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 4277#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 4278#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 4279#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 4219#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 4220#L509-7 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 4213#L509-9 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 4214#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 4237#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 4225#L509-11 strlen_#res := strlen_~i~0; 4222#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 4223#L529 assume !(0 == strstr_~nl~0 % 4294967296); 4226#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 4227#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 4247#L532 assume strstr_#t~short17;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 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 4207#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 4204#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 4205#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem8;havoc memcmp_#t~mem7;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 4246#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 4287#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 4280#L518 assume 0 != memcmp_~r~0;havoc memcmp_#t~mem8;havoc memcmp_#t~mem7;memcmp_#res := memcmp_~r~0; 4257#L523 strstr_#t~ret16 := memcmp_#res;strstr_#t~short17 := 0 == strstr_#t~ret16; 4256#L532-2 assume !strstr_#t~short17;havoc strstr_#t~short17;havoc strstr_#t~mem14;havoc strstr_#t~mem15;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 4254#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 4253#L531-3 assume !!(0 != strstr_~i~1 % 4294967296);call strstr_#t~mem14 := read~int(strstr_~haystack.base, strstr_~haystack.offset, 1);call strstr_#t~mem15 := read~int(strstr_~needle.base, strstr_~needle.offset, 1);strstr_#t~short17 := strstr_#t~mem14 == strstr_#t~mem15; 4208#L532 assume strstr_#t~short17;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 := 1 + memcmp_~count;memcmp_~count := 1 + memcmp_~count;havoc memcmp_#t~pre5; 4206#L517-3 [2019-11-19 22:21:26,115 INFO L796 eck$LassoCheckResult]: Loop: 4206#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 4202#L517-1 assume !!(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6;call memcmp_#t~mem7 := read~int(memcmp_~d~0.base, memcmp_~d~0.offset, 1);call memcmp_#t~mem8 := read~int(memcmp_~s~0.base, memcmp_~s~0.offset, 1);memcmp_~r~0 := memcmp_#t~mem7 % 256 - memcmp_#t~mem8 % 256; 4203#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem8;havoc memcmp_#t~mem7;memcmp_#t~pre9.base, memcmp_#t~pre9.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;memcmp_~d~0.base, memcmp_~d~0.offset := memcmp_~d~0.base, 1 + memcmp_~d~0.offset;havoc memcmp_#t~pre9.base, memcmp_#t~pre9.offset;memcmp_#t~pre10.base, memcmp_#t~pre10.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;memcmp_~s~0.base, memcmp_~s~0.offset := memcmp_~s~0.base, 1 + memcmp_~s~0.offset;havoc memcmp_#t~pre10.base, memcmp_#t~pre10.offset; 4206#L517-3 [2019-11-19 22:21:26,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:26,115 INFO L82 PathProgramCache]: Analyzing trace with hash -224601240, now seen corresponding path program 3 times [2019-11-19 22:21:26,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:26,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123149412] [2019-11-19 22:21:26,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:26,261 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:26,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:26,262 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 9 times [2019-11-19 22:21:26,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:26,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101077135] [2019-11-19 22:21:26,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:26,271 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:26,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:26,272 INFO L82 PathProgramCache]: Analyzing trace with hash 463587919, now seen corresponding path program 4 times [2019-11-19 22:21:26,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:21:26,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429523657] [2019-11-19 22:21:26,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:21:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:21:26,400 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:21:30,115 WARN L191 SmtUtils]: Spent 3.62 s on a formula simplification. DAG size of input: 476 DAG size of output: 338 [2019-11-19 22:21:30,553 WARN L191 SmtUtils]: Spent 413.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-11-19 22:21:30,557 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:21:30,557 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:21:30,557 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:21:30,558 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:21:30,558 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:21:30,558 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:30,558 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:21:30,558 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:21:30,558 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration16_Lasso [2019-11-19 22:21:30,558 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:21:30,559 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:21:30,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:30,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:32,076 WARN L191 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 135 [2019-11-19 22:21:32,495 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2019-11-19 22:21:32,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:32,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:32,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:32,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:32,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:32,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:32,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:21:32,928 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2019-11-19 22:21:33,641 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-19 22:21:34,648 WARN L191 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-19 22:21:34,735 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:21:34,735 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:34,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:34,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:34,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:34,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:34,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:34,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:34,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:34,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:34,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:34,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:34,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:34,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:34,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:34,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:34,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:34,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:34,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 122 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:34,761 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:34,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:34,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:34,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:34,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:34,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:34,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:34,770 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:34,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:34,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:34,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:34,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:34,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:34,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:34,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:34,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:34,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:34,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:34,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:34,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:34,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:34,792 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:34,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:34,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:34,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:34,793 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:34,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 125 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:34,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:34,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:34,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:34,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:34,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:34,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:34,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:34,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:34,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 126 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:34,806 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:34,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:34,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:34,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:34,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:34,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:34,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:34,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 127 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:34,828 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:34,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:34,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:34,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:34,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:34,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:34,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:34,843 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:34,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 128 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:34,845 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:34,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:34,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:34,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:34,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:34,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:34,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:34,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:34,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 129 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:34,863 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:34,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:34,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:34,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:34,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:34,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:34,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:34,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:34,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 130 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:34,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:34,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:34,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:34,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:34,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:34,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:34,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:34,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:34,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 131 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:34,893 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:34,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:34,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:34,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:34,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:34,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:34,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:34,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:34,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 132 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:34,907 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:34,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:34,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:34,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:34,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:34,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:34,922 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:34,922 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 133 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:34,927 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:34,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:34,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:34,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:34,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:34,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:34,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:34,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:34,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 134 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:34,943 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:34,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:34,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:34,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:34,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:34,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:34,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:34,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:34,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 135 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:34,960 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:34,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:34,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:34,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:34,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:34,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:34,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:34,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:34,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 136 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:34,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:34,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:34,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:34,987 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:34,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:34,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:34,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:34,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:34,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 137 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:34,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:34,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:35,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:35,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:35,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:35,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:35,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:35,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:35,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 138 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:35,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:35,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:35,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:35,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:35,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:35,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:35,020 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:35,020 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 139 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:35,026 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:35,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:35,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:35,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:35,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:35,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:35,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:35,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:35,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 140 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:35,038 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:35,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:35,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:35,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:35,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:35,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:35,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:35,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 141 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:35,052 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:35,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:35,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:35,064 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:35,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:35,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:35,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:35,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:35,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 142 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:35,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:35,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:35,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:35,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:35,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:35,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:35,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:35,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:35,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 143 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:35,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:35,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:35,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:35,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:35,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:35,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:35,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:35,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:35,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 144 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:35,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:35,105 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:35,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:35,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:21:35,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:35,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:35,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:35,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:21:35,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 145 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:35,115 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:35,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:35,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:35,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:35,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:35,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:35,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:35,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 146 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:35,132 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 147 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:35,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:35,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:35,151 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-19 22:21:35,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:35,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:35,153 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-19 22:21:35,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 147 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:35,157 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:35,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:35,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:35,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:35,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:35,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:21:35,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:35,167 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 148 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:35,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:21:35,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:21:35,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:21:35,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:21:35,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:21:35,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 149 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:35,200 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:21:35,201 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:21:35,240 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:21:35,357 INFO L443 ModelExtractionUtils]: Simplification made 36 calls to the SMT solver. [2019-11-19 22:21:35,358 INFO L444 ModelExtractionUtils]: 34 out of 73 variables were initially zero. Simplification set additionally 36 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 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 150 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:21:35,361 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:21:35,363 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 22:21:35,364 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:21:35,364 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_memcmp_~s~0.offset, v_rep(select #length ULTIMATE.start_memcmp_~s~0.base)_3) = -1*ULTIMATE.start_memcmp_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_memcmp_~s~0.base)_3 Supporting invariants [] [2019-11-19 22:21:35,837 INFO L297 tatePredicateManager]: 77 out of 77 supporting invariants were superfluous and have been removed [2019-11-19 22:21:35,838 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-19 22:21:35,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:35,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:21:35,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:35,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:21:35,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:35,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:35,931 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-19 22:21:35,931 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 102 transitions. cyclomatic complexity: 18 Second operand 4 states. [2019-11-19 22:21:35,953 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 102 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 118 states and 135 transitions. Complement of second has 7 states. [2019-11-19 22:21:35,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-19 22:21:35,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-19 22:21:35,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2019-11-19 22:21:35,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 44 letters. Loop has 3 letters. [2019-11-19 22:21:35,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:35,958 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:21:35,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:36,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:21:36,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:36,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:21:36,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:36,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:36,038 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-19 22:21:36,038 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 102 transitions. cyclomatic complexity: 18 Second operand 4 states. [2019-11-19 22:21:36,056 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 102 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 118 states and 135 transitions. Complement of second has 7 states. [2019-11-19 22:21:36,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-19 22:21:36,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-19 22:21:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2019-11-19 22:21:36,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 44 letters. Loop has 3 letters. [2019-11-19 22:21:36,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:36,057 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 22:21:36,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:21:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:36,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:21:36,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:21:36,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:21:36,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:21:36,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:21:36,136 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-19 22:21:36,136 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 102 transitions. cyclomatic complexity: 18 Second operand 4 states. [2019-11-19 22:21:36,161 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 102 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 118 states and 135 transitions. Complement of second has 6 states. [2019-11-19 22:21:36,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-19 22:21:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-19 22:21:36,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2019-11-19 22:21:36,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 44 letters. Loop has 3 letters. [2019-11-19 22:21:36,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:36,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 47 letters. Loop has 3 letters. [2019-11-19 22:21:36,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:36,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 44 letters. Loop has 6 letters. [2019-11-19 22:21:36,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:21:36,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 135 transitions. [2019-11-19 22:21:36,165 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 22:21:36,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 0 states and 0 transitions. [2019-11-19 22:21:36,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-19 22:21:36,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-19 22:21:36,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-19 22:21:36,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:21:36,165 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:21:36,165 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:21:36,165 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:21:36,166 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-11-19 22:21:36,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:21:36,166 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 22:21:36,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-19 22:21:36,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 10:21:36 BoogieIcfgContainer [2019-11-19 22:21:36,173 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-19 22:21:36,174 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:21:36,174 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:21:36,174 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:21:36,175 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:20:55" (3/4) ... [2019-11-19 22:21:36,178 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 22:21:36,178 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:21:36,180 INFO L168 Benchmark]: Toolchain (without parser) took 41640.04 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 613.9 MB). Free memory was 963.0 MB in the beginning and 854.1 MB in the end (delta: 108.9 MB). Peak memory consumption was 722.9 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:36,180 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:21:36,181 INFO L168 Benchmark]: CACSL2BoogieTranslator took 612.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -166.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:36,181 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.82 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:36,181 INFO L168 Benchmark]: Boogie Preprocessor took 75.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:21:36,182 INFO L168 Benchmark]: RCFGBuilder took 490.78 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:36,182 INFO L168 Benchmark]: BuchiAutomizer took 40381.23 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 472.9 MB). Free memory was 1.1 GB in the beginning and 854.1 MB in the end (delta: 237.4 MB). Peak memory consumption was 710.3 MB. Max. memory is 11.5 GB. [2019-11-19 22:21:36,183 INFO L168 Benchmark]: Witness Printer took 4.79 ms. Allocated memory is still 1.6 GB. Free memory is still 854.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:21:36,185 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 612.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -166.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.82 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.47 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 490.78 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 40381.23 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 472.9 MB). Free memory was 1.1 GB in the beginning and 854.1 MB in the end (delta: 237.4 MB). Peak memory consumption was 710.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.79 ms. Allocated memory is still 1.6 GB. Free memory is still 854.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 16 terminating modules (10 trivial, 5 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (out_len)] + -1 * s and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (in_len)] + -1 * s and consists of 6 locations. One deterministic module has affine ranking function -1 * haystack + unknown-#length-unknown[hay] and consists of 6 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[haystack] and consists of 7 locations. One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[s] and consists of 5 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 22 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 40.3s and 17 iterations. TraceHistogramMax:4. Analysis of lassos took 34.7s. Construction of modules took 1.4s. Büchi inclusion checks took 3.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 15. Automata minimization 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 425 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 91 states and ocurred in iteration 14. Nontrivial modules had stage [5, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 564 SDtfs, 1265 SDslu, 1820 SDs, 0 SdLazy, 1433 SolverSat, 195 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU10 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital304 mio100 ax100 hnf99 lsp88 ukn87 mio100 lsp44 div106 bol100 ite100 ukn100 eq189 hnf86 smp97 dnf153 smp86 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms 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...