./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_509be496-6b3c-4b92-bda7-66585ed7b4dd/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_509be496-6b3c-4b92-bda7-66585ed7b4dd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_509be496-6b3c-4b92-bda7-66585ed7b4dd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_509be496-6b3c-4b92-bda7-66585ed7b4dd/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strstr.i -s /tmp/vcloud-vcloud-master/worker/working_dir_509be496-6b3c-4b92-bda7-66585ed7b4dd/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_509be496-6b3c-4b92-bda7-66585ed7b4dd/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 938c367f37ddd298c829be75f27a69a6e9a1154b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:26,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:26,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:26,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:26,453 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:26,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:26,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:26,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:26,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:26,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:26,459 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:26,460 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:26,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:26,461 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:26,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:26,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:26,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:26,465 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:26,466 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:26,468 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:26,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:26,470 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:26,471 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:26,472 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:26,474 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:26,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:26,475 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:26,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:26,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:26,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:26,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:26,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:26,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:26,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:26,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:26,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:26,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:26,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:26,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:26,482 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:26,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:26,483 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_509be496-6b3c-4b92-bda7-66585ed7b4dd/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:59:26,513 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:26,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:26,515 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:26,515 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:26,515 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:26,515 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:59:26,516 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:59:26,516 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:59:26,519 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:59:26,519 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:59:26,520 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:59:26,520 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:26,520 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:59:26,520 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:26,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:26,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:59:26,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:59:26,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:59:26,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:26,521 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:59:26,521 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:26,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:59:26,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:26,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:26,522 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:59:26,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:26,522 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:26,523 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:59:26,523 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:59:26,524 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_509be496-6b3c-4b92-bda7-66585ed7b4dd/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 938c367f37ddd298c829be75f27a69a6e9a1154b [2019-10-22 08:59:26,562 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:26,578 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:26,581 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:26,583 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:26,583 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:26,584 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_509be496-6b3c-4b92-bda7-66585ed7b4dd/bin/uautomizer/../../sv-benchmarks/c/termination-libowfat/strstr.i [2019-10-22 08:59:26,630 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_509be496-6b3c-4b92-bda7-66585ed7b4dd/bin/uautomizer/data/f85212c91/a15388d1250d409d8469d22009e51408/FLAG1633d74e4 [2019-10-22 08:59:27,062 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:27,063 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_509be496-6b3c-4b92-bda7-66585ed7b4dd/sv-benchmarks/c/termination-libowfat/strstr.i [2019-10-22 08:59:27,073 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_509be496-6b3c-4b92-bda7-66585ed7b4dd/bin/uautomizer/data/f85212c91/a15388d1250d409d8469d22009e51408/FLAG1633d74e4 [2019-10-22 08:59:27,090 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_509be496-6b3c-4b92-bda7-66585ed7b4dd/bin/uautomizer/data/f85212c91/a15388d1250d409d8469d22009e51408 [2019-10-22 08:59:27,093 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:27,094 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:27,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:27,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:27,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:27,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:27" (1/1) ... [2019-10-22 08:59:27,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46fbf80b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:27, skipping insertion in model container [2019-10-22 08:59:27,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:27" (1/1) ... [2019-10-22 08:59:27,108 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:27,138 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:27,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:27,463 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:27,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:27,535 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:27,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:27 WrapperNode [2019-10-22 08:59:27,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:27,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:27,536 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:27,536 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:27,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:27" (1/1) ... [2019-10-22 08:59:27,559 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:27" (1/1) ... [2019-10-22 08:59:27,582 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:27,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:27,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:27,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:27,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:27" (1/1) ... [2019-10-22 08:59:27,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:27" (1/1) ... [2019-10-22 08:59:27,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:27" (1/1) ... [2019-10-22 08:59:27,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:27" (1/1) ... [2019-10-22 08:59:27,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:27" (1/1) ... [2019-10-22 08:59:27,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:27" (1/1) ... [2019-10-22 08:59:27,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:27" (1/1) ... [2019-10-22 08:59:27,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:27,612 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:27,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:27,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:27,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509be496-6b3c-4b92-bda7-66585ed7b4dd/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:27,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:59:27,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:59:27,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:59:27,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:59:27,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:27,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:28,112 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:28,112 INFO L284 CfgBuilder]: Removed 16 assume(true) statements. [2019-10-22 08:59:28,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:28 BoogieIcfgContainer [2019-10-22 08:59:28,113 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:28,114 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:59:28,114 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:59:28,117 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:59:28,118 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:28,118 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:59:27" (1/3) ... [2019-10-22 08:59:28,119 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cb2060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:28, skipping insertion in model container [2019-10-22 08:59:28,120 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:28,120 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:27" (2/3) ... [2019-10-22 08:59:28,120 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cb2060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:59:28, skipping insertion in model container [2019-10-22 08:59:28,120 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:59:28,120 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:28" (3/3) ... [2019-10-22 08:59:28,122 INFO L371 chiAutomizerObserver]: Analyzing ICFG strstr.i [2019-10-22 08:59:28,165 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:59:28,166 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:59:28,166 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:59:28,166 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:28,166 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:28,166 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:59:28,167 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:28,167 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:59:28,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-10-22 08:59:28,203 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-10-22 08:59:28,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:28,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:28,211 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:28,211 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:28,211 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:59:28,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2019-10-22 08:59:28,213 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2019-10-22 08:59:28,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:28,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:28,214 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:59:28,214 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:28,222 INFO L791 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-10-22 08:59:28,222 INFO L793 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-10-22 08:59:28,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:28,228 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2019-10-22 08:59:28,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:28,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920871050] [2019-10-22 08:59:28,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:28,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:28,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:28,389 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:28,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:28,391 INFO L82 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 1 times [2019-10-22 08:59:28,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:28,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79995948] [2019-10-22 08:59:28,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:28,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:28,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:28,404 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:28,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:28,406 INFO L82 PathProgramCache]: Analyzing trace with hash 179566670, now seen corresponding path program 1 times [2019-10-22 08:59:28,406 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:28,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911051772] [2019-10-22 08:59:28,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:28,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:28,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:28,491 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:28,981 WARN L191 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 99 [2019-10-22 08:59:29,147 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-10-22 08:59:29,162 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:29,163 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:29,164 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:29,164 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:29,164 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:29,164 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:29,164 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:29,165 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:29,165 INFO L131 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration1_Lasso [2019-10-22 08:59:29,165 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:29,165 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:29,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:29,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:29,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-10-22 08:59:29,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:29,490 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-10-22 08:59:29,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:29,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:29,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:29,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:29,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-10-22 08:59:29,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:29,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-10-22 08:59:29,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:29,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-10-22 08:59:29,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:29,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:29,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:29,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-10-22 08:59:29,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:29,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:29,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:29,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-10-22 08:59:29,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-10-22 08:59:29,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-10-22 08:59:29,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-10-22 08:59:29,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-10-22 08:59:29,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-10-22 08:59:29,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-10-22 08:59:29,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-10-22 08:59:30,316 WARN L191 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:59:30,415 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:30,419 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:30,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-10-22 08:59:30,423 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:30,423 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:30,423 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:30,424 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:30,424 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:30,426 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:30,426 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:30,428 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:30,428 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-10-22 08:59:30,429 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:30,429 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:30,429 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:30,429 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:30,430 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:30,430 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:30,430 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:30,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:30,431 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-10-22 08:59:30,432 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:30,432 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:30,432 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:30,432 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:30,433 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:30,433 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:30,433 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:30,434 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:30,434 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-10-22 08:59:30,435 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:30,435 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:30,435 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:30,435 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:30,439 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:30,439 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:30,449 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:30,450 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-10-22 08:59:30,450 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:30,450 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:30,450 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:30,451 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:30,453 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:30,453 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:30,466 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:30,466 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-10-22 08:59:30,467 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:30,467 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:30,467 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:30,467 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:59:30,467 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:30,468 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:59:30,468 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:30,471 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:30,472 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-10-22 08:59:30,473 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:30,473 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:59:30,473 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:30,473 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:30,481 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:59:30,491 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:30,561 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:30,563 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-10-22 08:59:30,565 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:30,566 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:30,566 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:30,566 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:30,566 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:30,567 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:30,569 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:30,569 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-10-22 08:59:30,570 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:30,570 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:30,570 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:30,570 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:30,573 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:30,574 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:30,607 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:30,661 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 08:59:30,661 INFO L444 ModelExtractionUtils]: 25 out of 31 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:59:30,664 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:30,669 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:30,669 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:30,670 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strlen_~s.base)_1, ULTIMATE.start_strlen_~s.offset) = 1*v_rep(select #length ULTIMATE.start_strlen_~s.base)_1 - 1*ULTIMATE.start_strlen_~s.offset Supporting invariants [] [2019-10-22 08:59:30,699 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-10-22 08:59:30,706 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:59:30,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:30,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:30,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:30,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:30,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:30,784 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-10-22 08:59:30,785 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 3 states. [2019-10-22 08:59:30,827 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 3 states. Result 90 states and 130 transitions. Complement of second has 6 states. [2019-10-22 08:59:30,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:30,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:30,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2019-10-22 08:59:30,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 5 letters. Loop has 3 letters. [2019-10-22 08:59:30,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:30,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 8 letters. Loop has 3 letters. [2019-10-22 08:59:30,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:30,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 5 letters. Loop has 6 letters. [2019-10-22 08:59:30,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:30,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 130 transitions. [2019-10-22 08:59:30,837 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2019-10-22 08:59:30,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 47 states and 62 transitions. [2019-10-22 08:59:30,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2019-10-22 08:59:30,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-10-22 08:59:30,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 62 transitions. [2019-10-22 08:59:30,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:30,844 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-10-22 08:59:30,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 62 transitions. [2019-10-22 08:59:30,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-10-22 08:59:30,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 08:59:30,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-10-22 08:59:30,874 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-10-22 08:59:30,874 INFO L591 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-10-22 08:59:30,874 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:59:30,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 62 transitions. [2019-10-22 08:59:30,876 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2019-10-22 08:59:30,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:30,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:30,876 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:30,876 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:30,877 INFO L791 eck$LassoCheckResult]: Stem: 241#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 219#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; 220#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; 227#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; 232#L508 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 234#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; 246#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 223#L509-10 [2019-10-22 08:59:30,877 INFO L793 eck$LassoCheckResult]: Loop: 223#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 224#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; 240#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; 223#L509-10 [2019-10-22 08:59:30,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:30,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1806906284, now seen corresponding path program 1 times [2019-10-22 08:59:30,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:30,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579486347] [2019-10-22 08:59:30,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:30,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:30,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:30,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:30,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579486347] [2019-10-22 08:59:30,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:30,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:30,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193210574] [2019-10-22 08:59:30,931 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:30,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:30,931 INFO L82 PathProgramCache]: Analyzing trace with hash 72652, now seen corresponding path program 1 times [2019-10-22 08:59:30,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:30,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722383476] [2019-10-22 08:59:30,931 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:30,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:30,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:30,939 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:30,975 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:30,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:30,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:30,978 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-10-22 08:59:31,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:31,001 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2019-10-22 08:59:31,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:31,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2019-10-22 08:59:31,003 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-10-22 08:59:31,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 36 transitions. [2019-10-22 08:59:31,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-10-22 08:59:31,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-10-22 08:59:31,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2019-10-22 08:59:31,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:31,004 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-10-22 08:59:31,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2019-10-22 08:59:31,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-22 08:59:31,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 08:59:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-10-22 08:59:31,009 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-10-22 08:59:31,009 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-10-22 08:59:31,009 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:59:31,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2019-10-22 08:59:31,010 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-10-22 08:59:31,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:31,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:31,010 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:31,010 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:31,010 INFO L791 eck$LassoCheckResult]: Stem: 317#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 295#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; 296#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; 304#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; 311#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 312#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 314#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 316#L509-5 strlen_#res := strlen_~i~0; 301#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; 302#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 298#L509-10 [2019-10-22 08:59:31,010 INFO L793 eck$LassoCheckResult]: Loop: 298#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 303#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; 297#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; 298#L509-10 [2019-10-22 08:59:31,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:31,011 INFO L82 PathProgramCache]: Analyzing trace with hash 764823385, now seen corresponding path program 1 times [2019-10-22 08:59:31,011 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:31,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300954837] [2019-10-22 08:59:31,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:31,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:31,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:31,062 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:31,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:31,063 INFO L82 PathProgramCache]: Analyzing trace with hash 72652, now seen corresponding path program 2 times [2019-10-22 08:59:31,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:31,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685495796] [2019-10-22 08:59:31,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:31,063 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:31,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:31,079 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:31,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:31,081 INFO L82 PathProgramCache]: Analyzing trace with hash 52000116, now seen corresponding path program 1 times [2019-10-22 08:59:31,082 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:31,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690773] [2019-10-22 08:59:31,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:31,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:31,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:31,126 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:31,603 WARN L191 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 118 [2019-10-22 08:59:31,709 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-10-22 08:59:31,710 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:31,711 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:31,711 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:31,711 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:31,711 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:31,711 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:31,711 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:31,711 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:31,711 INFO L131 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration3_Lasso [2019-10-22 08:59:31,711 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:31,712 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:31,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:31,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:31,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-10-22 08:59:31,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-10-22 08:59:31,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-10-22 08:59:31,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-10-22 08:59:31,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-10-22 08:59:31,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:31,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:31,951 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-10-22 08:59:32,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:32,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:32,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:32,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-10-22 08:59:32,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:32,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:32,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-10-22 08:59:32,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:32,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-10-22 08:59:32,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:32,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:32,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:32,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-10-22 08:59:32,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:32,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:32,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:32,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:32,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:32,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:32,585 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:59:32,622 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:32,623 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:32,623 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-10-22 08:59:32,624 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:32,624 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:32,630 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:32,630 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:32,631 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:32,631 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:32,631 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:32,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:32,632 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-10-22 08:59:32,632 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:32,633 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:32,633 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:32,633 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:32,633 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:32,633 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:32,634 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:32,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:32,635 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-10-22 08:59:32,635 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:32,635 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:32,635 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:32,636 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:32,636 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:32,641 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:32,642 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:32,642 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:32,642 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-10-22 08:59:32,643 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:32,643 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:32,643 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:32,643 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:32,643 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:32,644 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:32,644 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:32,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:32,645 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-10-22 08:59:32,645 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:32,645 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:32,646 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:32,646 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:32,647 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:32,647 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:32,654 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:32,656 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-10-22 08:59:32,657 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:32,657 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:32,657 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:32,657 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:32,657 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:32,658 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:32,658 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:32,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:32,659 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-10-22 08:59:32,659 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:32,659 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:32,660 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:32,660 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:32,663 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:32,663 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:32,664 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:32,665 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-10-22 08:59:32,665 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:32,665 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:32,666 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:32,666 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:32,666 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:32,666 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:32,666 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:32,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:32,667 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-10-22 08:59:32,667 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:32,668 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:32,668 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:32,672 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:32,673 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:32,673 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:32,675 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:32,680 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-10-22 08:59:32,681 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:32,681 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:32,682 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:32,682 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:32,683 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:32,683 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:32,689 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:32,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-10-22 08:59:32,690 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:32,690 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:32,691 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:32,691 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:32,694 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:32,694 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:32,731 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:32,767 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 08:59:32,767 INFO L444 ModelExtractionUtils]: 44 out of 49 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-10-22 08:59:32,768 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:32,769 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:32,771 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:32,771 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s.offset, v_rep(select #length ULTIMATE.start_strlen_~s.base)_2) = -1*ULTIMATE.start_strlen_~s.offset + 1*v_rep(select #length ULTIMATE.start_strlen_~s.base)_2 Supporting invariants [] [2019-10-22 08:59:32,812 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2019-10-22 08:59:32,813 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:59:32,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:32,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:32,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:32,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:32,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:32,870 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-10-22 08:59:32,870 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 36 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 08:59:32,899 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 36 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 57 states and 72 transitions. Complement of second has 4 states. [2019-10-22 08:59:32,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:59:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:59:32,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2019-10-22 08:59:32,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 10 letters. Loop has 3 letters. [2019-10-22 08:59:32,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:32,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 13 letters. Loop has 3 letters. [2019-10-22 08:59:32,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:32,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 48 transitions. Stem has 10 letters. Loop has 6 letters. [2019-10-22 08:59:32,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:32,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 72 transitions. [2019-10-22 08:59:32,906 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-10-22 08:59:32,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 43 states and 54 transitions. [2019-10-22 08:59:32,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-10-22 08:59:32,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2019-10-22 08:59:32,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2019-10-22 08:59:32,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:32,907 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-10-22 08:59:32,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2019-10-22 08:59:32,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-10-22 08:59:32,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 08:59:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2019-10-22 08:59:32,914 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-10-22 08:59:32,914 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2019-10-22 08:59:32,914 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:59:32,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2019-10-22 08:59:32,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 08:59:32,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:32,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:32,915 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:32,915 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:32,915 INFO L791 eck$LassoCheckResult]: Stem: 512#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 490#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; 491#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; 501#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; 506#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 507#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 509#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 511#L509-5 strlen_#res := strlen_~i~0; 494#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; 495#L508-2 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 499#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 500#L529 assume !(0 == strstr_~nl~0 % 4294967296); 504#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 505#L531-3 [2019-10-22 08:59:32,916 INFO L793 eck$LassoCheckResult]: Loop: 505#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; 488#L532 assume !strstr_#t~short17; 489#L532-2 assume !strstr_#t~short17;havoc strstr_#t~ret16;havoc strstr_#t~mem14;havoc strstr_#t~short17;havoc strstr_#t~mem15;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; 503#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 505#L531-3 [2019-10-22 08:59:32,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:32,916 INFO L82 PathProgramCache]: Analyzing trace with hash 51953446, now seen corresponding path program 1 times [2019-10-22 08:59:32,916 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:32,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772658987] [2019-10-22 08:59:32,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:32,916 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:32,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:32,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:32,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772658987] [2019-10-22 08:59:32,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:32,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:59:32,964 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788985557] [2019-10-22 08:59:32,965 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:32,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:32,965 INFO L82 PathProgramCache]: Analyzing trace with hash 3227613, now seen corresponding path program 1 times [2019-10-22 08:59:32,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:32,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929330265] [2019-10-22 08:59:32,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:32,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:32,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:32,976 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:33,077 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:33,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:59:33,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:59:33,077 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-10-22 08:59:33,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:33,122 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2019-10-22 08:59:33,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:33,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2019-10-22 08:59:33,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 08:59:33,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 38 transitions. [2019-10-22 08:59:33,123 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-10-22 08:59:33,124 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-10-22 08:59:33,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2019-10-22 08:59:33,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:33,124 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-10-22 08:59:33,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2019-10-22 08:59:33,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-22 08:59:33,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 08:59:33,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-10-22 08:59:33,126 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-10-22 08:59:33,126 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-10-22 08:59:33,126 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:59:33,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2019-10-22 08:59:33,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 08:59:33,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:33,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:33,127 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:33,127 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:33,128 INFO L791 eck$LassoCheckResult]: Stem: 584#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 560#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; 561#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; 571#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; 578#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 579#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 581#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 583#L509-5 strlen_#res := strlen_~i~0; 566#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; 567#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 568#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 570#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 574#L509-11 strlen_#res := strlen_~i~0; 572#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 573#L529 assume !(0 == strstr_~nl~0 % 4294967296); 575#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 576#L531-3 [2019-10-22 08:59:33,128 INFO L793 eck$LassoCheckResult]: Loop: 576#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; 564#L532 assume !strstr_#t~short17; 565#L532-2 assume !strstr_#t~short17;havoc strstr_#t~ret16;havoc strstr_#t~mem14;havoc strstr_#t~short17;havoc strstr_#t~mem15;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; 577#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 576#L531-3 [2019-10-22 08:59:33,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:33,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1349410205, now seen corresponding path program 1 times [2019-10-22 08:59:33,129 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:33,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178085728] [2019-10-22 08:59:33,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:33,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:33,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:33,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:33,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:33,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178085728] [2019-10-22 08:59:33,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:33,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:59:33,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352573582] [2019-10-22 08:59:33,168 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:33,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:33,168 INFO L82 PathProgramCache]: Analyzing trace with hash 3227613, now seen corresponding path program 2 times [2019-10-22 08:59:33,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:33,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738331812] [2019-10-22 08:59:33,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:33,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:33,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:33,176 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:33,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:33,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:59:33,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:59:33,252 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-10-22 08:59:33,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:33,299 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2019-10-22 08:59:33,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:59:33,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 74 transitions. [2019-10-22 08:59:33,300 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-10-22 08:59:33,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 47 states and 56 transitions. [2019-10-22 08:59:33,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2019-10-22 08:59:33,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-10-22 08:59:33,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 56 transitions. [2019-10-22 08:59:33,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:33,302 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 56 transitions. [2019-10-22 08:59:33,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 56 transitions. [2019-10-22 08:59:33,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2019-10-22 08:59:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 08:59:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2019-10-22 08:59:33,304 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-10-22 08:59:33,304 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2019-10-22 08:59:33,304 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:59:33,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2019-10-22 08:59:33,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 08:59:33,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:33,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:33,305 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-10-22 08:59:33,306 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:33,306 INFO L791 eck$LassoCheckResult]: Stem: 693#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 671#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; 672#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; 682#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; 687#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 688#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 689#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; 694#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; 690#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 691#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 692#L509-5 strlen_#res := strlen_~i~0; 675#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; 676#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 677#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 679#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 683#L509-11 strlen_#res := strlen_~i~0; 680#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 681#L529 assume !(0 == strstr_~nl~0 % 4294967296); 684#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 685#L531-3 [2019-10-22 08:59:33,306 INFO L793 eck$LassoCheckResult]: Loop: 685#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; 669#L532 assume !strstr_#t~short17; 670#L532-2 assume !strstr_#t~short17;havoc strstr_#t~ret16;havoc strstr_#t~mem14;havoc strstr_#t~short17;havoc strstr_#t~mem15;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; 686#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 685#L531-3 [2019-10-22 08:59:33,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:33,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1796108770, now seen corresponding path program 1 times [2019-10-22 08:59:33,306 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:33,306 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386026964] [2019-10-22 08:59:33,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:33,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:33,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:33,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:59:33,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386026964] [2019-10-22 08:59:33,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:33,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:59:33,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830951498] [2019-10-22 08:59:33,360 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:33,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:33,360 INFO L82 PathProgramCache]: Analyzing trace with hash 3227613, now seen corresponding path program 3 times [2019-10-22 08:59:33,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:33,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101706869] [2019-10-22 08:59:33,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:33,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:33,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:33,368 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:33,453 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:33,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:59:33,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:59:33,454 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand 6 states. [2019-10-22 08:59:33,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:33,495 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-10-22 08:59:33,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:59:33,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 43 transitions. [2019-10-22 08:59:33,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 08:59:33,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 33 states and 38 transitions. [2019-10-22 08:59:33,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-10-22 08:59:33,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-10-22 08:59:33,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 38 transitions. [2019-10-22 08:59:33,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:33,496 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-10-22 08:59:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 38 transitions. [2019-10-22 08:59:33,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-10-22 08:59:33,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 08:59:33,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-10-22 08:59:33,498 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-10-22 08:59:33,498 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-10-22 08:59:33,498 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:59:33,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2019-10-22 08:59:33,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-10-22 08:59:33,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:33,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:33,499 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-10-22 08:59:33,499 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 08:59:33,499 INFO L791 eck$LassoCheckResult]: Stem: 777#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 753#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; 754#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; 764#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; 771#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 772#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 773#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; 778#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; 774#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 775#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 776#L509-5 strlen_#res := strlen_~i~0; 759#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; 760#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 761#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 762#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; 755#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; 756#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 763#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 767#L509-11 strlen_#res := strlen_~i~0; 765#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 766#L529 assume !(0 == strstr_~nl~0 % 4294967296); 768#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 769#L531-3 [2019-10-22 08:59:33,499 INFO L793 eck$LassoCheckResult]: Loop: 769#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; 757#L532 assume !strstr_#t~short17; 758#L532-2 assume !strstr_#t~short17;havoc strstr_#t~ret16;havoc strstr_#t~mem14;havoc strstr_#t~short17;havoc strstr_#t~mem15;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; 770#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 769#L531-3 [2019-10-22 08:59:33,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:33,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1624521053, now seen corresponding path program 1 times [2019-10-22 08:59:33,500 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:33,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123172636] [2019-10-22 08:59:33,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:33,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:33,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:33,530 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:33,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:33,531 INFO L82 PathProgramCache]: Analyzing trace with hash 3227613, now seen corresponding path program 4 times [2019-10-22 08:59:33,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:33,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18243917] [2019-10-22 08:59:33,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:33,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:33,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:33,542 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:33,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:33,542 INFO L82 PathProgramCache]: Analyzing trace with hash 16049535, now seen corresponding path program 1 times [2019-10-22 08:59:33,542 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:33,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661274536] [2019-10-22 08:59:33,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:33,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:33,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:33,586 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:34,284 WARN L191 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 162 [2019-10-22 08:59:34,437 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-10-22 08:59:34,438 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:34,438 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:34,438 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:34,438 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:34,438 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:34,438 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:34,438 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:34,438 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:34,439 INFO L131 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration7_Lasso [2019-10-22 08:59:34,439 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:34,439 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:34,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:34,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:34,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:34,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:34,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-10-22 08:59:34,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:34,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:34,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:34,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:34,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:34,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:34,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:34,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-10-22 08:59:34,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:34,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-10-22 08:59:34,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-10-22 08:59:34,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:34,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:34,880 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 90 [2019-10-22 08:59:34,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:34,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:34,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:34,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:34,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:34,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:34,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:35,524 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-10-22 08:59:35,646 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:35,646 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:35,646 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-10-22 08:59:35,647 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,647 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:35,647 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,647 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,647 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,648 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:35,648 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:35,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,649 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-10-22 08:59:35,649 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,649 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:35,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,650 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,650 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,650 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:35,650 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:35,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,651 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-10-22 08:59:35,651 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,651 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:35,651 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,652 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,652 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,652 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:35,653 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:35,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,653 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-10-22 08:59:35,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,654 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,654 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,654 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,655 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:35,655 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:35,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,657 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-10-22 08:59:35,657 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,658 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:35,658 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,658 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,658 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,658 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:35,658 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:35,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,668 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-10-22 08:59:35,668 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,668 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:35,668 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,668 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,669 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,669 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:35,669 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:35,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,670 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-10-22 08:59:35,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,670 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:35,670 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,670 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,670 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,671 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:35,671 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:35,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,671 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-10-22 08:59:35,672 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,673 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:35,673 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,673 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,673 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,674 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:35,674 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:35,674 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,674 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-10-22 08:59:35,675 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,675 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:35,675 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,675 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,675 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,676 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:35,676 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:35,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,678 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-10-22 08:59:35,692 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,692 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:35,693 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,693 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,693 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,693 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:35,693 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:35,693 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,694 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-10-22 08:59:35,694 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,694 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,694 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,694 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,696 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:35,696 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:35,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,720 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-10-22 08:59:35,726 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,727 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,727 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,727 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,727 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:35,727 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:35,728 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,729 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-10-22 08:59:35,729 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,729 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:35,729 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,729 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,729 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,730 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:35,730 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:35,730 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,730 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-10-22 08:59:35,731 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,731 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:35,731 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,731 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,731 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,731 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:35,731 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:35,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,732 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-10-22 08:59:35,736 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,736 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:35,737 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,737 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,737 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,737 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:35,737 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:35,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,738 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-10-22 08:59:35,738 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,738 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:35,738 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,738 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,738 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,738 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:35,739 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:35,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,739 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-10-22 08:59:35,739 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,739 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,740 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,740 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,743 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:35,744 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:35,745 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,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-10-22 08:59:35,745 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,745 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,745 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,745 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,746 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:35,746 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:35,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,747 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-10-22 08:59:35,747 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,747 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,748 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,748 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,751 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:35,751 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:35,755 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,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-10-22 08:59:35,758 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,758 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,758 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,758 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,759 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:35,760 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:35,762 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,763 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-10-22 08:59:35,765 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,766 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,766 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,766 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,766 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:35,767 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:35,767 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,768 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-10-22 08:59:35,768 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,768 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,768 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,768 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,769 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:35,769 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:35,770 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,770 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-10-22 08:59:35,770 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,770 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,770 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,770 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,771 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:35,771 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:35,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,776 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-10-22 08:59:35,777 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,778 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:59:35,778 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,778 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,781 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:59:35,785 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:35,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,805 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-10-22 08:59:35,806 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,806 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,806 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,806 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,807 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:35,807 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:35,807 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,808 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-10-22 08:59:35,809 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,809 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:59:35,809 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:59:35,809 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,811 INFO L400 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2019-10-22 08:59:35,812 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-10-22 08:59:35,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:35,823 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-10-22 08:59:35,824 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:35,824 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:35,824 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:35,824 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:35,827 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:35,827 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:35,896 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:35,950 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-10-22 08:59:35,950 INFO L444 ModelExtractionUtils]: 45 out of 52 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:59:35,951 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:35,952 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:35,952 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:35,952 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strstr_~haystack.offset, v_rep(select #length ULTIMATE.start_strstr_~haystack.base)_1) = -1*ULTIMATE.start_strstr_~haystack.offset + 1*v_rep(select #length ULTIMATE.start_strstr_~haystack.base)_1 Supporting invariants [] [2019-10-22 08:59:36,048 INFO L297 tatePredicateManager]: 31 out of 31 supporting invariants were superfluous and have been removed [2019-10-22 08:59:36,050 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:59:36,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:36,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:36,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:36,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:36,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:36,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:36,111 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:59:36,111 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-10-22 08:59:36,125 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2019-10-22 08:59:36,125 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-10-22 08:59:36,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:59:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2019-10-22 08:59:36,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 22 letters. Loop has 4 letters. [2019-10-22 08:59:36,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:36,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 26 letters. Loop has 4 letters. [2019-10-22 08:59:36,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:36,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 22 letters. Loop has 8 letters. [2019-10-22 08:59:36,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:36,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2019-10-22 08:59:36,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:36,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 38 states and 45 transitions. [2019-10-22 08:59:36,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-10-22 08:59:36,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-10-22 08:59:36,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 45 transitions. [2019-10-22 08:59:36,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:36,129 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-10-22 08:59:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 45 transitions. [2019-10-22 08:59:36,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-10-22 08:59:36,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-22 08:59:36,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2019-10-22 08:59:36,131 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-10-22 08:59:36,131 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 44 transitions. [2019-10-22 08:59:36,131 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:59:36,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 44 transitions. [2019-10-22 08:59:36,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:36,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:36,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:36,132 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-10-22 08:59:36,132 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:36,132 INFO L791 eck$LassoCheckResult]: Stem: 1079#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1057#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; 1058#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; 1066#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; 1073#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1074#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1075#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; 1080#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; 1076#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1077#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1078#L509-5 strlen_#res := strlen_~i~0; 1061#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; 1062#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1063#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1064#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; 1059#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; 1060#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1065#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1070#L509-11 strlen_#res := strlen_~i~0; 1067#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 1068#L529 assume !(0 == strstr_~nl~0 % 4294967296); 1071#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 1072#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; 1054#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; 1051#L517-3 [2019-10-22 08:59:36,133 INFO L793 eck$LassoCheckResult]: Loop: 1051#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 1046#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; 1047#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;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; 1051#L517-3 [2019-10-22 08:59:36,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:36,133 INFO L82 PathProgramCache]: Analyzing trace with hash -2091601114, now seen corresponding path program 1 times [2019-10-22 08:59:36,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:36,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331981605] [2019-10-22 08:59:36,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:36,133 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:36,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:36,159 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:36,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:36,160 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 1 times [2019-10-22 08:59:36,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:36,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362410169] [2019-10-22 08:59:36,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:36,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:36,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:36,168 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:36,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:36,168 INFO L82 PathProgramCache]: Analyzing trace with hash 496824785, now seen corresponding path program 1 times [2019-10-22 08:59:36,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:36,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097332719] [2019-10-22 08:59:36,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:36,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:36,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:36,200 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:37,295 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 269 DAG size of output: 198 [2019-10-22 08:59:37,537 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-10-22 08:59:37,540 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:37,540 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:37,540 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:37,540 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:37,540 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:37,540 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:37,540 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:37,540 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:37,540 INFO L131 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration8_Lasso [2019-10-22 08:59:37,540 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:37,540 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:37,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:37,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:37,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-10-22 08:59:37,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:37,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-10-22 08:59:37,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:37,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-10-22 08:59:37,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:37,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:37,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:37,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:37,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:37,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:37,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:37,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-10-22 08:59:37,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:37,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:37,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:37,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-10-22 08:59:37,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-10-22 08:59:37,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-10-22 08:59:37,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-10-22 08:59:37,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:37,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-10-22 08:59:37,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:37,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:37,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-10-22 08:59:38,201 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 124 [2019-10-22 08:59:38,370 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-10-22 08:59:38,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:38,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:38,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:38,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:39,368 WARN L191 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-10-22 08:59:39,594 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:39,594 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:39,595 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-10-22 08:59:39,595 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,595 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,595 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,596 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,596 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,596 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,597 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,597 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,597 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-10-22 08:59:39,598 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,598 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,598 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,598 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,598 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,598 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,598 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,599 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-10-22 08:59:39,599 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,600 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,600 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,600 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,600 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,601 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,601 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,601 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,612 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-10-22 08:59:39,612 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,613 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,613 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,613 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,613 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,613 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,613 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,614 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,614 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-10-22 08:59:39,614 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,614 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,614 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,614 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,615 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,615 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,615 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,615 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-10-22 08:59:39,616 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,616 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,616 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,617 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,617 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,617 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,617 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,618 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-10-22 08:59:39,618 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,618 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,618 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,618 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,619 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:39,619 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:39,620 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,628 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-10-22 08:59:39,628 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,629 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,629 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,629 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,629 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,629 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,629 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,630 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-10-22 08:59:39,630 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,630 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,630 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,630 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,630 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,631 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,631 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,631 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,631 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-10-22 08:59:39,631 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,632 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,632 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,632 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,632 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,633 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,633 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,633 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,633 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-10-22 08:59:39,634 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,634 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,634 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,634 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,634 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,634 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,634 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,635 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-10-22 08:59:39,635 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,636 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,636 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,636 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,636 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,636 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,637 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,637 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-10-22 08:59:39,638 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,638 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,638 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,638 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,638 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:39,638 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:39,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,639 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-10-22 08:59:39,640 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,640 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,645 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,646 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,646 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,646 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,646 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,647 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-10-22 08:59:39,648 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,648 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,648 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,648 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,648 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,648 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,648 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,649 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-10-22 08:59:39,649 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,649 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,649 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,650 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,651 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:39,651 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:39,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,707 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-10-22 08:59:39,708 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,708 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,709 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,709 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,709 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,709 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,709 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,710 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,710 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-10-22 08:59:39,710 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,710 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,710 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,710 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,711 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,711 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,711 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,711 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,711 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-10-22 08:59:39,712 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,712 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,712 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,713 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,713 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,713 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,713 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,714 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-10-22 08:59:39,714 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,714 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,714 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,714 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,714 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,714 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,714 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,715 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,715 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-10-22 08:59:39,715 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,715 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,715 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,715 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,716 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,716 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,716 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,717 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,717 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-10-22 08:59:39,717 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,717 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,717 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,718 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,718 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,718 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,718 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,719 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-10-22 08:59:39,719 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,719 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,719 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,719 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,719 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,719 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,719 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,720 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-10-22 08:59:39,721 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,721 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,721 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,721 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,721 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,721 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,721 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,722 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-10-22 08:59:39,722 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,722 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,723 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,723 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,723 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,723 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,723 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,723 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,724 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-10-22 08:59:39,724 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,724 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:39,725 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,725 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,725 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,725 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:39,725 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:39,726 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,726 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-10-22 08:59:39,726 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,726 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:59:39,726 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,727 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,731 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:59:39,731 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:39,753 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,753 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-10-22 08:59:39,753 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,753 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,754 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,754 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,754 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:39,754 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:39,755 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,755 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-10-22 08:59:39,756 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,756 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,756 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,756 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,757 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:39,757 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:39,758 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,758 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-10-22 08:59:39,758 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,758 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,759 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,759 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,759 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:39,759 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:39,760 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,761 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-10-22 08:59:39,761 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,761 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:59:39,761 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,761 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,763 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:59:39,763 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:39,771 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,772 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-10-22 08:59:39,772 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,772 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,772 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,772 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,773 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:39,773 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:39,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,774 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-10-22 08:59:39,774 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,774 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,774 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,775 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,775 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:39,775 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:39,779 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,779 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-10-22 08:59:39,779 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,779 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,780 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,780 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,780 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:39,780 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:39,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,782 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-10-22 08:59:39,782 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,782 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,782 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,782 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,783 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:39,783 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:39,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,784 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-10-22 08:59:39,784 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,785 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,785 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,785 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,785 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:39,785 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:39,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:39,789 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-10-22 08:59:39,789 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:39,789 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:39,790 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:39,790 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:39,793 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:39,793 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:39,853 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:39,927 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 08:59:39,931 INFO L444 ModelExtractionUtils]: 67 out of 73 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 08:59:39,931 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:39,932 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:39,932 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:39,932 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)_1) = -1*ULTIMATE.start_memcmp_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_memcmp_~s~0.base)_1 Supporting invariants [] [2019-10-22 08:59:40,129 INFO L297 tatePredicateManager]: 45 out of 45 supporting invariants were superfluous and have been removed [2019-10-22 08:59:40,130 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:59:40,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:40,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:40,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:40,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:40,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:40,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:40,193 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-10-22 08:59:40,193 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 44 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-10-22 08:59:40,219 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 44 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 84 states and 102 transitions. Complement of second has 7 states. [2019-10-22 08:59:40,221 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-10-22 08:59:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:59:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2019-10-22 08:59:40,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 24 letters. Loop has 3 letters. [2019-10-22 08:59:40,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:40,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 27 letters. Loop has 3 letters. [2019-10-22 08:59:40,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:40,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 24 letters. Loop has 6 letters. [2019-10-22 08:59:40,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:40,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 102 transitions. [2019-10-22 08:59:40,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:40,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 61 states and 74 transitions. [2019-10-22 08:59:40,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-10-22 08:59:40,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2019-10-22 08:59:40,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 74 transitions. [2019-10-22 08:59:40,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:40,226 INFO L688 BuchiCegarLoop]: Abstraction has 61 states and 74 transitions. [2019-10-22 08:59:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 74 transitions. [2019-10-22 08:59:40,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 46. [2019-10-22 08:59:40,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-22 08:59:40,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2019-10-22 08:59:40,233 INFO L711 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2019-10-22 08:59:40,233 INFO L591 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2019-10-22 08:59:40,233 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:59:40,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 55 transitions. [2019-10-22 08:59:40,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:40,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:40,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:40,234 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:40,235 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:40,235 INFO L791 eck$LassoCheckResult]: Stem: 1488#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1465#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; 1466#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; 1474#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; 1482#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1483#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1484#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; 1489#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; 1485#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1486#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1487#L509-5 strlen_#res := strlen_~i~0; 1469#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; 1470#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1471#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1472#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; 1467#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; 1468#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1473#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1479#L509-11 strlen_#res := strlen_~i~0; 1475#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 1476#L529 assume !(0 == strstr_~nl~0 % 4294967296); 1480#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 1481#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; 1462#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; 1464#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 1494#L517-1 assume !(0 != memcmp_#t~pre6 % 4294967296);havoc memcmp_#t~pre6; 1459#L517-4 memcmp_#res := 0; 1460#L523 strstr_#t~ret16 := memcmp_#res;strstr_#t~short17 := 0 == strstr_#t~ret16; 1477#L532-2 assume !strstr_#t~short17;havoc strstr_#t~ret16;havoc strstr_#t~mem14;havoc strstr_#t~short17;havoc strstr_#t~mem15;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; 1478#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 1491#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; 1461#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; 1456#L517-3 [2019-10-22 08:59:40,235 INFO L793 eck$LassoCheckResult]: Loop: 1456#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 1452#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; 1453#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;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; 1456#L517-3 [2019-10-22 08:59:40,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:40,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1259680368, now seen corresponding path program 1 times [2019-10-22 08:59:40,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:40,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869768069] [2019-10-22 08:59:40,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:40,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 08:59:40,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869768069] [2019-10-22 08:59:40,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:40,265 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:59:40,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852762872] [2019-10-22 08:59:40,265 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:40,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:40,266 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 2 times [2019-10-22 08:59:40,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:40,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879854108] [2019-10-22 08:59:40,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:40,275 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:40,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:40,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:40,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:40,352 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-10-22 08:59:40,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:40,371 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2019-10-22 08:59:40,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:40,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 56 transitions. [2019-10-22 08:59:40,372 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:40,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 45 states and 52 transitions. [2019-10-22 08:59:40,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-10-22 08:59:40,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-10-22 08:59:40,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 52 transitions. [2019-10-22 08:59:40,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:40,373 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-10-22 08:59:40,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 52 transitions. [2019-10-22 08:59:40,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-10-22 08:59:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 08:59:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-10-22 08:59:40,377 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-10-22 08:59:40,377 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-10-22 08:59:40,377 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 08:59:40,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 52 transitions. [2019-10-22 08:59:40,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:40,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:40,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:40,378 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:40,378 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:40,378 INFO L791 eck$LassoCheckResult]: Stem: 1590#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1566#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; 1567#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; 1575#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; 1582#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1583#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1584#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; 1591#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; 1585#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1586#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1587#L509-5 strlen_#res := strlen_~i~0; 1570#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; 1571#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1572#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1573#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; 1568#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; 1569#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1574#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1579#L509-11 strlen_#res := strlen_~i~0; 1576#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 1577#L529 assume !(0 == strstr_~nl~0 % 4294967296); 1580#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 1581#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; 1563#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; 1565#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 1557#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; 1558#L518 assume 0 != memcmp_~r~0;havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#res := memcmp_~r~0; 1588#L523 strstr_#t~ret16 := memcmp_#res;strstr_#t~short17 := 0 == strstr_#t~ret16; 1589#L532-2 assume !strstr_#t~short17;havoc strstr_#t~ret16;havoc strstr_#t~mem14;havoc strstr_#t~short17;havoc strstr_#t~mem15;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; 1595#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 1594#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; 1562#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; 1559#L517-3 [2019-10-22 08:59:40,378 INFO L793 eck$LassoCheckResult]: Loop: 1559#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 1555#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; 1556#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;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; 1559#L517-3 [2019-10-22 08:59:40,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:40,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1432054472, now seen corresponding path program 1 times [2019-10-22 08:59:40,379 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:40,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412227428] [2019-10-22 08:59:40,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:40,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:40,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412227428] [2019-10-22 08:59:40,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345535378] [2019-10-22 08:59:40,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509be496-6b3c-4b92-bda7-66585ed7b4dd/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:40,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-22 08:59:40,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:40,726 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:40,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 25 [2019-10-22 08:59:40,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:40,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:40,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 08:59:40,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:3 [2019-10-22 08:59:40,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 08:59:40,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:59:40,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-22 08:59:40,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205572986] [2019-10-22 08:59:40,749 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:40,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:40,750 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 3 times [2019-10-22 08:59:40,750 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:40,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167692347] [2019-10-22 08:59:40,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:40,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:40,760 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:40,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:40,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:59:40,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:59:40,842 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-10-22 08:59:40,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:40,940 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2019-10-22 08:59:40,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:59:40,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 64 transitions. [2019-10-22 08:59:40,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:40,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 55 states and 62 transitions. [2019-10-22 08:59:40,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-10-22 08:59:40,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-10-22 08:59:40,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 62 transitions. [2019-10-22 08:59:40,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:40,943 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 62 transitions. [2019-10-22 08:59:40,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 62 transitions. [2019-10-22 08:59:40,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2019-10-22 08:59:40,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-22 08:59:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2019-10-22 08:59:40,945 INFO L711 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-10-22 08:59:40,946 INFO L591 BuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2019-10-22 08:59:40,946 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 08:59:40,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 56 transitions. [2019-10-22 08:59:40,946 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:40,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:40,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:40,947 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:40,947 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:40,947 INFO L791 eck$LassoCheckResult]: Stem: 1808#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1780#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; 1781#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; 1793#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; 1800#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1801#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1802#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; 1809#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; 1803#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1804#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1805#L509-5 strlen_#res := strlen_~i~0; 1788#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; 1789#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1790#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1791#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; 1782#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; 1783#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1792#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1796#L509-11 strlen_#res := strlen_~i~0; 1794#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 1795#L529 assume !(0 == strstr_~nl~0 % 4294967296); 1797#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 1798#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; 1785#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; 1787#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 1821#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; 1822#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;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; 1820#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 1819#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; 1814#L518 assume 0 != memcmp_~r~0;havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#res := memcmp_~r~0; 1806#L523 strstr_#t~ret16 := memcmp_#res;strstr_#t~short17 := 0 == strstr_#t~ret16; 1807#L532-2 assume !strstr_#t~short17;havoc strstr_#t~ret16;havoc strstr_#t~mem14;havoc strstr_#t~short17;havoc strstr_#t~mem15;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; 1816#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 1815#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; 1784#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; 1778#L517-3 [2019-10-22 08:59:40,947 INFO L793 eck$LassoCheckResult]: Loop: 1778#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 1774#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; 1775#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;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; 1778#L517-3 [2019-10-22 08:59:40,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:40,947 INFO L82 PathProgramCache]: Analyzing trace with hash 428144867, now seen corresponding path program 1 times [2019-10-22 08:59:40,948 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:40,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290644276] [2019-10-22 08:59:40,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:40,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:41,057 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:59:41,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290644276] [2019-10-22 08:59:41,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294989982] [2019-10-22 08:59:41,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509be496-6b3c-4b92-bda7-66585ed7b4dd/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:41,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-22 08:59:41,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:41,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:41,379 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:41,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 29 [2019-10-22 08:59:41,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:59:41,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:41,393 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:41,393 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 27 [2019-10-22 08:59:41,394 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 08:59:41,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 08:59:41,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-22 08:59:41,401 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:14 [2019-10-22 08:59:42,174 WARN L191 SmtUtils]: Spent 741.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-10-22 08:59:42,181 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:59:42,182 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:42,182 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2019-10-22 08:59:42,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948805509] [2019-10-22 08:59:42,182 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:42,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:42,183 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 4 times [2019-10-22 08:59:42,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:42,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490798756] [2019-10-22 08:59:42,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:42,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:42,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:42,191 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:42,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:42,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-22 08:59:42,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-10-22 08:59:42,279 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. cyclomatic complexity: 13 Second operand 19 states. [2019-10-22 08:59:43,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:43,485 INFO L93 Difference]: Finished difference Result 185 states and 205 transitions. [2019-10-22 08:59:43,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-22 08:59:43,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 205 transitions. [2019-10-22 08:59:43,486 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 08:59:43,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 118 states and 135 transitions. [2019-10-22 08:59:43,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-10-22 08:59:43,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-10-22 08:59:43,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 135 transitions. [2019-10-22 08:59:43,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:43,488 INFO L688 BuchiCegarLoop]: Abstraction has 118 states and 135 transitions. [2019-10-22 08:59:43,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 135 transitions. [2019-10-22 08:59:43,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 77. [2019-10-22 08:59:43,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-22 08:59:43,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-10-22 08:59:43,492 INFO L711 BuchiCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-10-22 08:59:43,492 INFO L591 BuchiCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-10-22 08:59:43,492 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-10-22 08:59:43,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 87 transitions. [2019-10-22 08:59:43,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:43,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:43,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:43,493 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-10-22 08:59:43,494 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:43,494 INFO L791 eck$LassoCheckResult]: Stem: 2258#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2230#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; 2231#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; 2241#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; 2247#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 2248#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2249#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; 2268#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; 2250#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2251#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; 2260#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; 2269#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2259#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 2252#L509-5 strlen_#res := strlen_~i~0; 2232#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; 2233#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 2234#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2235#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; 2225#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; 2226#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2238#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; 2255#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; 2236#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2237#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 2244#L509-11 strlen_#res := strlen_~i~0; 2245#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 2261#L529 assume !(0 == strstr_~nl~0 % 4294967296); 2262#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 2266#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; 2267#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; 2288#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2287#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; 2264#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;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; 2265#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2220#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; 2221#L518 assume 0 != memcmp_~r~0;havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#res := memcmp_~r~0; 2274#L523 strstr_#t~ret16 := memcmp_#res;strstr_#t~short17 := 0 == strstr_#t~ret16; 2273#L532-2 assume !strstr_#t~short17;havoc strstr_#t~ret16;havoc strstr_#t~mem14;havoc strstr_#t~short17;havoc strstr_#t~mem15;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; 2271#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 2270#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; 2227#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; 2222#L517-3 [2019-10-22 08:59:43,494 INFO L793 eck$LassoCheckResult]: Loop: 2222#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2218#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; 2219#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;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; 2222#L517-3 [2019-10-22 08:59:43,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:43,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1050158307, now seen corresponding path program 2 times [2019-10-22 08:59:43,494 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:43,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531265979] [2019-10-22 08:59:43,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:43,681 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:59:43,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531265979] [2019-10-22 08:59:43,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429130097] [2019-10-22 08:59:43,682 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509be496-6b3c-4b92-bda7-66585ed7b4dd/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:43,817 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:59:43,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:59:43,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-22 08:59:43,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:59:43,922 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:43,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2019-10-22 08:59:43,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979716375] [2019-10-22 08:59:43,923 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:43,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:43,923 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 5 times [2019-10-22 08:59:43,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:43,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029590666] [2019-10-22 08:59:43,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:43,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:43,933 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:44,003 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:44,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-22 08:59:44,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-10-22 08:59:44,004 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. cyclomatic complexity: 17 Second operand 19 states. [2019-10-22 08:59:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:44,237 INFO L93 Difference]: Finished difference Result 259 states and 296 transitions. [2019-10-22 08:59:44,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 08:59:44,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 259 states and 296 transitions. [2019-10-22 08:59:44,240 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2019-10-22 08:59:44,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 259 states to 238 states and 274 transitions. [2019-10-22 08:59:44,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2019-10-22 08:59:44,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2019-10-22 08:59:44,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 238 states and 274 transitions. [2019-10-22 08:59:44,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:44,241 INFO L688 BuchiCegarLoop]: Abstraction has 238 states and 274 transitions. [2019-10-22 08:59:44,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states and 274 transitions. [2019-10-22 08:59:44,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 91. [2019-10-22 08:59:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-22 08:59:44,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2019-10-22 08:59:44,258 INFO L711 BuchiCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-10-22 08:59:44,258 INFO L591 BuchiCegarLoop]: Abstraction has 91 states and 103 transitions. [2019-10-22 08:59:44,258 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-10-22 08:59:44,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 103 transitions. [2019-10-22 08:59:44,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:44,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:44,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:44,259 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-10-22 08:59:44,259 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:44,259 INFO L791 eck$LassoCheckResult]: Stem: 2745#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2716#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; 2717#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; 2725#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; 2732#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 2733#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2736#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; 2756#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; 2737#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2738#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; 2748#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; 2757#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2758#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 2739#L509-5 strlen_#res := strlen_~i~0; 2740#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; 2734#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 2735#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2770#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; 2769#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; 2767#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 2768#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 2785#L509-11 strlen_#res := strlen_~i~0; 2784#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 2783#L529 assume !(0 == strstr_~nl~0 % 4294967296); 2782#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 2781#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; 2779#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; 2778#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2776#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; 2777#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;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; 2775#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2774#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; 2773#L518 assume 0 != memcmp_~r~0;havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#res := memcmp_~r~0; 2743#L523 strstr_#t~ret16 := memcmp_#res;strstr_#t~short17 := 0 == strstr_#t~ret16; 2744#L532-2 assume !strstr_#t~short17;havoc strstr_#t~ret16;havoc strstr_#t~mem14;havoc strstr_#t~short17;havoc strstr_#t~mem15;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; 2749#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 2750#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; 2772#L532 assume !strstr_#t~short17; 2766#L532-2 assume !strstr_#t~short17;havoc strstr_#t~ret16;havoc strstr_#t~mem14;havoc strstr_#t~short17;havoc strstr_#t~mem15;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; 2764#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 2762#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; 2713#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; 2710#L517-3 [2019-10-22 08:59:44,260 INFO L793 eck$LassoCheckResult]: Loop: 2710#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 2706#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; 2707#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;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; 2710#L517-3 [2019-10-22 08:59:44,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:44,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1867103268, now seen corresponding path program 1 times [2019-10-22 08:59:44,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:44,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016498966] [2019-10-22 08:59:44,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:44,412 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-22 08:59:44,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016498966] [2019-10-22 08:59:44,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426219941] [2019-10-22 08:59:44,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_509be496-6b3c-4b92-bda7-66585ed7b4dd/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:59:44,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:44,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-22 08:59:44,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-22 08:59:44,603 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:59:44,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2019-10-22 08:59:44,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881981072] [2019-10-22 08:59:44,604 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:59:44,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:44,604 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 6 times [2019-10-22 08:59:44,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:44,604 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565379368] [2019-10-22 08:59:44,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,604 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:44,614 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:44,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:44,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 08:59:44,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-10-22 08:59:44,686 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. cyclomatic complexity: 19 Second operand 16 states. [2019-10-22 08:59:44,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:44,897 INFO L93 Difference]: Finished difference Result 195 states and 223 transitions. [2019-10-22 08:59:44,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:59:44,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 223 transitions. [2019-10-22 08:59:44,899 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-10-22 08:59:44,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 190 states and 218 transitions. [2019-10-22 08:59:44,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2019-10-22 08:59:44,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2019-10-22 08:59:44,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 190 states and 218 transitions. [2019-10-22 08:59:44,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:59:44,901 INFO L688 BuchiCegarLoop]: Abstraction has 190 states and 218 transitions. [2019-10-22 08:59:44,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states and 218 transitions. [2019-10-22 08:59:44,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 91. [2019-10-22 08:59:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-22 08:59:44,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2019-10-22 08:59:44,905 INFO L711 BuchiCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-10-22 08:59:44,905 INFO L591 BuchiCegarLoop]: Abstraction has 91 states and 102 transitions. [2019-10-22 08:59:44,905 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-10-22 08:59:44,905 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 102 transitions. [2019-10-22 08:59:44,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:59:44,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:59:44,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:59:44,906 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-10-22 08:59:44,906 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:59:44,906 INFO L791 eck$LassoCheckResult]: Stem: 3180#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3151#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; 3152#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; 3161#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; 3168#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 3169#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3172#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; 3188#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; 3173#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3174#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; 3191#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; 3192#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3181#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 3182#L509-5 strlen_#res := strlen_~i~0; 3155#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; 3156#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 3157#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3158#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; 3216#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; 3217#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3218#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; 3219#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; 3159#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3160#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; 3153#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; 3154#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 3177#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 3165#L509-11 strlen_#res := strlen_~i~0; 3162#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 3163#L529 assume !(0 == strstr_~nl~0 % 4294967296); 3166#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 3167#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; 3187#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; 3147#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 3144#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; 3145#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;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; 3186#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 3224#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; 3220#L518 assume 0 != memcmp_~r~0;havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;memcmp_#res := memcmp_~r~0; 3197#L523 strstr_#t~ret16 := memcmp_#res;strstr_#t~short17 := 0 == strstr_#t~ret16; 3196#L532-2 assume !strstr_#t~short17;havoc strstr_#t~ret16;havoc strstr_#t~mem14;havoc strstr_#t~short17;havoc strstr_#t~mem15;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; 3194#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 3193#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; 3148#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; 3146#L517-3 [2019-10-22 08:59:44,907 INFO L793 eck$LassoCheckResult]: Loop: 3146#L517-3 memcmp_#t~pre6 := memcmp_~count - 1;memcmp_~count := memcmp_~count - 1; 3142#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; 3143#L518 assume !(0 != memcmp_~r~0);havoc memcmp_#t~mem7;havoc memcmp_#t~mem8;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; 3146#L517-3 [2019-10-22 08:59:44,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:44,907 INFO L82 PathProgramCache]: Analyzing trace with hash -224601240, now seen corresponding path program 3 times [2019-10-22 08:59:44,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:44,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567605175] [2019-10-22 08:59:44,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:44,984 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:44,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:44,985 INFO L82 PathProgramCache]: Analyzing trace with hash 111382, now seen corresponding path program 7 times [2019-10-22 08:59:44,985 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:44,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988019180] [2019-10-22 08:59:44,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:44,996 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:44,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:44,997 INFO L82 PathProgramCache]: Analyzing trace with hash 463587919, now seen corresponding path program 4 times [2019-10-22 08:59:44,997 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:44,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487667902] [2019-10-22 08:59:44,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:44,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:45,081 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:47,704 WARN L191 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 475 DAG size of output: 337 [2019-10-22 08:59:47,995 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 167 [2019-10-22 08:59:47,998 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:59:47,998 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:59:47,998 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:59:47,998 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:59:47,998 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:59:47,998 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:59:47,998 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:59:47,998 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:59:47,998 INFO L131 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration14_Lasso [2019-10-22 08:59:47,998 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:59:47,998 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:59:48,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,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-10-22 08:59:48,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-10-22 08:59:48,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,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-10-22 08:59:48,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,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-10-22 08:59:48,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,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-10-22 08:59:48,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-10-22 08:59:48,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:48,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:49,231 WARN L191 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 142 [2019-10-22 08:59:49,467 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 90 [2019-10-22 08:59:49,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:49,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:49,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:49,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:59:50,359 WARN L191 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-10-22 08:59:50,494 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-10-22 08:59:51,092 WARN L191 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-10-22 08:59:51,126 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:59:51,126 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:59:51,126 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-10-22 08:59:51,127 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,127 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,127 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,127 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,127 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,127 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,128 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,129 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-10-22 08:59:51,129 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,129 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,129 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,129 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,130 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,130 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,130 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,130 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,130 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-10-22 08:59:51,131 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,131 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,131 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,131 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,131 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,131 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,131 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,132 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,132 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-10-22 08:59:51,133 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,133 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,133 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,133 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,133 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,134 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,134 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,134 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,134 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-10-22 08:59:51,135 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,135 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,135 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,135 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,135 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,135 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,135 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,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-10-22 08:59:51,136 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,136 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,136 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,136 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,137 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,137 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,137 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,137 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,137 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-10-22 08:59:51,138 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,138 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,138 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,138 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,138 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,138 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,138 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,139 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,139 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-10-22 08:59:51,139 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,139 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,139 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,139 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,140 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,140 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,140 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,141 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-10-22 08:59:51,142 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,142 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,142 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,142 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,142 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,142 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,142 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,143 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-10-22 08:59:51,143 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,144 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,144 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,144 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,144 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,144 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,145 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,145 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,145 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-10-22 08:59:51,145 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,146 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,146 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,146 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,146 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,146 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,146 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,146 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,147 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-10-22 08:59:51,147 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,147 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,147 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,147 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,147 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,148 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,148 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,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-10-22 08:59:51,149 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,149 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,149 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,149 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,150 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,150 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,150 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,150 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-10-22 08:59:51,151 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,151 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,151 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,151 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,151 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,151 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,151 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,152 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-10-22 08:59:51,153 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,153 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,153 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,153 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,153 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,153 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,153 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,154 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-10-22 08:59:51,154 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,154 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,154 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,155 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,155 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,155 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,155 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,155 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,155 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-10-22 08:59:51,156 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,156 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,157 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,157 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,157 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,157 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,157 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,157 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,158 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-10-22 08:59:51,158 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,158 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,158 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,158 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,160 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:51,160 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,178 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-10-22 08:59:51,179 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,179 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,179 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,179 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,179 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,180 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,180 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,180 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,181 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-10-22 08:59:51,181 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,181 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,181 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,181 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,182 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:51,182 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,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-10-22 08:59:51,183 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,184 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,184 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,184 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,185 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:51,185 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,186 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,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-10-22 08:59:51,187 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,187 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,187 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,187 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,187 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,187 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,187 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,188 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-10-22 08:59:51,189 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,189 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,189 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,189 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,189 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,189 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,189 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,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-10-22 08:59:51,190 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,190 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,191 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,191 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,191 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:51,191 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,192 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,193 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-10-22 08:59:51,193 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,193 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,193 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,193 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,194 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,194 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,194 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,194 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-10-22 08:59:51,195 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,195 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,195 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,195 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,195 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,195 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,195 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,197 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-10-22 08:59:51,197 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,197 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:59:51,197 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,197 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,197 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,198 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:59:51,198 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:59:51,198 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,199 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-10-22 08:59:51,199 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,199 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,199 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,199 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,200 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:51,200 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,201 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-10-22 08:59:51,201 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,201 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 08:59:51,201 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,202 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,202 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 08:59:51,202 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,204 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-10-22 08:59:51,204 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,205 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,205 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,205 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,205 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:51,205 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,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-10-22 08:59:51,207 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,207 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 08:59:51,207 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,207 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,211 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 08:59:51,211 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,229 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:59:51,229 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-10-22 08:59:51,230 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:59:51,230 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:59:51,230 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:59:51,230 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:59:51,234 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:59:51,235 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:59:51,315 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:59:51,401 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-10-22 08:59:51,401 INFO L444 ModelExtractionUtils]: 69 out of 76 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 08:59:51,402 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:59:51,402 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 08:59:51,402 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:59:51,402 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)_2) = -1*ULTIMATE.start_memcmp_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_memcmp_~s~0.base)_2 Supporting invariants [] [2019-10-22 08:59:51,815 INFO L297 tatePredicateManager]: 77 out of 77 supporting invariants were superfluous and have been removed [2019-10-22 08:59:51,816 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 08:59:51,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:51,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:51,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:51,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:51,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:51,902 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-10-22 08:59:51,902 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 102 transitions. cyclomatic complexity: 18 Second operand 4 states. [2019-10-22 08:59:51,921 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-10-22 08:59:51,924 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-10-22 08:59:51,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:59:51,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2019-10-22 08:59:51,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 44 letters. Loop has 3 letters. [2019-10-22 08:59:51,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:51,925 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:59:51,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:51,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:51,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:51,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:51,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:52,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:52,003 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-10-22 08:59:52,003 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 102 transitions. cyclomatic complexity: 18 Second operand 4 states. [2019-10-22 08:59:52,019 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-10-22 08:59:52,020 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-10-22 08:59:52,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:59:52,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2019-10-22 08:59:52,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 44 letters. Loop has 3 letters. [2019-10-22 08:59:52,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:52,021 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:59:52,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:52,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:59:52,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:52,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 08:59:52,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:59:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:52,094 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-10-22 08:59:52,094 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 102 transitions. cyclomatic complexity: 18 Second operand 4 states. [2019-10-22 08:59:52,111 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-10-22 08:59:52,112 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-10-22 08:59:52,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:59:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2019-10-22 08:59:52,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 44 letters. Loop has 3 letters. [2019-10-22 08:59:52,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:52,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 47 letters. Loop has 3 letters. [2019-10-22 08:59:52,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:52,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 44 letters. Loop has 6 letters. [2019-10-22 08:59:52,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:59:52,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 135 transitions. [2019-10-22 08:59:52,116 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:52,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 0 states and 0 transitions. [2019-10-22 08:59:52,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:59:52,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:59:52,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:59:52,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:59:52,117 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:52,117 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:52,117 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:52,117 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-10-22 08:59:52,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:52,117 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:59:52,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:59:52,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:59:52 BoogieIcfgContainer [2019-10-22 08:59:52,124 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:59:52,124 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:52,124 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:52,124 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:52,125 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:28" (3/4) ... [2019-10-22 08:59:52,128 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:59:52,128 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:52,129 INFO L168 Benchmark]: Toolchain (without parser) took 25035.64 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 500.7 MB). Free memory was 937.8 MB in the beginning and 1.0 GB in the end (delta: -98.6 MB). Peak memory consumption was 402.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:52,130 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:52,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 440.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:52,130 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.03 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:52,131 INFO L168 Benchmark]: Boogie Preprocessor took 29.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:52,131 INFO L168 Benchmark]: RCFGBuilder took 501.10 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:52,131 INFO L168 Benchmark]: BuchiAutomizer took 24009.70 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 357.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.9 MB). Peak memory consumption was 408.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:52,132 INFO L168 Benchmark]: Witness Printer took 4.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:52,134 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 440.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.03 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 501.10 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 24009.70 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 357.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.9 MB). Peak memory consumption was 408.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 14 terminating modules (9 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. One deterministic module has affine ranking function -1 * haystack + unknown-#length-unknown[haystack] and consists of 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 4 locations. 9 modules have a trivial ranking function, the largest among these consists of 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 23.9s and 15 iterations. TraceHistogramMax:4. Analysis of lassos took 21.1s. Construction of modules took 0.7s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 13. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 339 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 91 states and ocurred in iteration 12. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 514 SDtfs, 999 SDslu, 1314 SDs, 0 SdLazy, 1076 SolverSat, 141 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU9 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital293 mio100 ax100 hnf99 lsp89 ukn86 mio100 lsp42 div107 bol100 ite100 ukn100 eq189 hnf86 smp98 dnf251 smp88 tf100 neg97 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms 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...