./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-dietlibc/strstr.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-dietlibc/strstr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 938c367f37ddd298c829be75f27a69a6e9a1154b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:32:08,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:32:08,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:32:09,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:32:09,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:32:09,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:32:09,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:32:09,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:32:09,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:32:09,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:32:09,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:32:09,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:32:09,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:32:09,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:32:09,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:32:09,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:32:09,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:32:09,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:32:09,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:32:09,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:32:09,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:32:09,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:32:09,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:32:09,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:32:09,056 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:32:09,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:32:09,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:32:09,057 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:32:09,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:32:09,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:32:09,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:32:09,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:32:09,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:32:09,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:32:09,065 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:32:09,065 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:32:09,066 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:32:09,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:32:09,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:32:09,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:32:09,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:32:09,071 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:32:09,101 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:32:09,102 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:32:09,103 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:32:09,104 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:32:09,104 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:32:09,104 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:32:09,104 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:32:09,104 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:32:09,105 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:32:09,105 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:32:09,106 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:32:09,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:32:09,107 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:32:09,107 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:32:09,107 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:32:09,108 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:32:09,108 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:32:09,108 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:32:09,108 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:32:09,109 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:32:09,109 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:32:09,109 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:32:09,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:32:09,110 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:32:09,110 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:32:09,110 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:32:09,111 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:32:09,111 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:32:09,111 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:32:09,113 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:32:09,113 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 938c367f37ddd298c829be75f27a69a6e9a1154b [2020-07-29 01:32:09,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:32:09,476 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:32:09,480 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:32:09,484 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:32:09,489 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:32:09,491 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strstr.i [2020-07-29 01:32:09,555 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e7d79168/d57170bba923434ca192d5560c57e9c2/FLAGf7b24ec72 [2020-07-29 01:32:10,148 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:32:10,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strstr.i [2020-07-29 01:32:10,161 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e7d79168/d57170bba923434ca192d5560c57e9c2/FLAGf7b24ec72 [2020-07-29 01:32:10,357 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e7d79168/d57170bba923434ca192d5560c57e9c2 [2020-07-29 01:32:10,360 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:32:10,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:32:10,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:32:10,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:32:10,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:32:10,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:32:10" (1/1) ... [2020-07-29 01:32:10,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd89e10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:10, skipping insertion in model container [2020-07-29 01:32:10,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:32:10" (1/1) ... [2020-07-29 01:32:10,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:32:10,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:32:10,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:32:10,830 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:32:10,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:32:10,961 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:32:10,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:10 WrapperNode [2020-07-29 01:32:10,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:32:10,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:32:10,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:32:10,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:32:10,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:10" (1/1) ... [2020-07-29 01:32:10,991 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:10" (1/1) ... [2020-07-29 01:32:11,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:32:11,029 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:32:11,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:32:11,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:32:11,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:10" (1/1) ... [2020-07-29 01:32:11,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:10" (1/1) ... [2020-07-29 01:32:11,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:10" (1/1) ... [2020-07-29 01:32:11,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:10" (1/1) ... [2020-07-29 01:32:11,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:10" (1/1) ... [2020-07-29 01:32:11,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:10" (1/1) ... [2020-07-29 01:32:11,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:10" (1/1) ... [2020-07-29 01:32:11,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:32:11,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:32:11,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:32:11,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:32:11,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:11,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:32:11,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:32:11,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:32:11,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:32:11,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:32:11,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:32:11,697 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:32:11,697 INFO L295 CfgBuilder]: Removed 16 assume(true) statements. [2020-07-29 01:32:11,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:32:11 BoogieIcfgContainer [2020-07-29 01:32:11,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:32:11,702 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:32:11,702 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:32:11,706 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:32:11,707 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:32:11,708 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:32:10" (1/3) ... [2020-07-29 01:32:11,709 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d6a9a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:32:11, skipping insertion in model container [2020-07-29 01:32:11,709 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:32:11,710 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:32:10" (2/3) ... [2020-07-29 01:32:11,710 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d6a9a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:32:11, skipping insertion in model container [2020-07-29 01:32:11,710 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:32:11,710 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:32:11" (3/3) ... [2020-07-29 01:32:11,712 INFO L371 chiAutomizerObserver]: Analyzing ICFG strstr.i [2020-07-29 01:32:11,766 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:32:11,766 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:32:11,767 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:32:11,767 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:32:11,768 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:32:11,768 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:32:11,769 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:32:11,769 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:32:11,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2020-07-29 01:32:11,816 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-07-29 01:32:11,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:11,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:11,822 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:32:11,822 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:32:11,823 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:32:11,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2020-07-29 01:32:11,829 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-07-29 01:32:11,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:11,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:11,830 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:32:11,830 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:32:11,838 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; 14#L541true assume !(main_~in_len~0 < 1);call main_#t~malloc20.base, main_#t~malloc20.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~hay~0.base, main_~hay~0.offset := main_#t~malloc20.base, main_#t~malloc20.offset;call write~int(0, main_~hay~0.base, main_~hay~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet21;havoc main_#t~nondet21; 25#L545true assume !(main_~out_len~0 < 1);call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~out_len~0);main_~needle~0.base, main_~needle~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call write~int(0, main_~needle~0.base, main_~needle~0.offset + (main_~out_len~0 - 1), 1);strstr_#in~haystack.base, strstr_#in~haystack.offset, strstr_#in~needle.base, strstr_#in~needle.offset := main_~hay~0.base, main_~hay~0.offset, main_~needle~0.base, main_~needle~0.offset;havoc strstr_#res.base, strstr_#res.offset;havoc strstr_#t~ret11, strstr_#t~ret12, strstr_#t~mem14, strstr_#t~mem15, strstr_#t~ret16, strstr_#t~short17, strstr_#t~pre18.base, strstr_#t~pre18.offset, strstr_#t~pre13, strstr_~haystack.base, strstr_~haystack.offset, strstr_~needle.base, strstr_~needle.offset, strstr_~nl~0, strstr_~hl~0, strstr_~i~1;strstr_~haystack.base, strstr_~haystack.offset := strstr_#in~haystack.base, strstr_#in~haystack.offset;strstr_~needle.base, strstr_~needle.offset := strstr_#in~needle.base, strstr_#in~needle.offset;strlen_#in~s.base, strlen_#in~s.offset := strstr_~needle.base, strstr_~needle.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 19#L508true assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 23#L509-4true [2020-07-29 01:32:11,838 INFO L796 eck$LassoCheckResult]: Loop: 23#L509-4true call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 29#L509-1true assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 34#L509-3true strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 23#L509-4true [2020-07-29 01:32:11,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:11,845 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2020-07-29 01:32:11,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:11,854 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58698310] [2020-07-29 01:32:11,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:11,979 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:12,007 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:12,033 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:12,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:12,035 INFO L82 PathProgramCache]: Analyzing trace with hash 50806, now seen corresponding path program 1 times [2020-07-29 01:32:12,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:12,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801954465] [2020-07-29 01:32:12,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:12,044 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:12,050 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:12,054 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:12,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:12,056 INFO L82 PathProgramCache]: Analyzing trace with hash 179566670, now seen corresponding path program 1 times [2020-07-29 01:32:12,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:12,057 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555359204] [2020-07-29 01:32:12,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:12,128 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:12,157 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:12,168 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:12,782 WARN L193 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 96 [2020-07-29 01:32:12,975 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-07-29 01:32:12,990 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:32:12,991 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:32:12,992 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:32:12,992 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:32:12,992 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:32:12,992 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:12,993 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:32:12,993 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:32:12,993 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration1_Lasso [2020-07-29 01:32:12,994 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:32:12,994 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:32:13,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,470 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2020-07-29 01:32:13,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:13,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:14,889 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:32:14,894 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:14,901 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 [2020-07-29 01:32:14,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:14,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:14,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:14,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:14,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:14,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:14,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:14,909 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:14,935 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 [2020-07-29 01:32:14,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:14,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:14,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:14,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:14,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:14,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:14,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:14,945 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:14,971 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 [2020-07-29 01:32:14,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:14,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:14,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:14,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:14,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:14,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:14,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:14,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:14,998 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 [2020-07-29 01:32:15,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:15,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:15,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:15,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:15,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:15,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:15,028 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:15,056 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 [2020-07-29 01:32:15,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:15,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:15,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:15,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:15,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:15,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:15,087 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:32:15,268 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-07-29 01:32:15,269 INFO L444 ModelExtractionUtils]: 20 out of 31 variables were initially zero. Simplification set additionally 8 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:15,279 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:15,283 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:32:15,284 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:32:15,285 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_1, ULTIMATE.start_strlen_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc22.base)_1 - 1*ULTIMATE.start_strlen_~s.offset Supporting invariants [] [2020-07-29 01:32:15,365 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2020-07-29 01:32:15,373 INFO L393 LassoCheck]: Loop: "call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 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;" "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;" [2020-07-29 01:32:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:15,404 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:32:15,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:15,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:32:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:15,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:15,508 INFO L280 TraceCheckUtils]: 0: Hoare triple {43#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {43#unseeded} is VALID [2020-07-29 01:32:15,509 INFO L280 TraceCheckUtils]: 1: Hoare triple {43#unseeded} 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; {43#unseeded} is VALID [2020-07-29 01:32:15,510 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#unseeded} 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; {43#unseeded} is VALID [2020-07-29 01:32:15,512 INFO L280 TraceCheckUtils]: 3: Hoare triple {43#unseeded} 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; {102#(and (= ULTIMATE.start_strlen_~s.base |ULTIMATE.start_main_#t~malloc22.base|) unseeded)} is VALID [2020-07-29 01:32:15,513 INFO L280 TraceCheckUtils]: 4: Hoare triple {102#(and (= ULTIMATE.start_strlen_~s.base |ULTIMATE.start_main_#t~malloc22.base|) unseeded)} assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; {102#(and (= ULTIMATE.start_strlen_~s.base |ULTIMATE.start_main_#t~malloc22.base|) unseeded)} is VALID [2020-07-29 01:32:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:15,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:32:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:15,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:15,563 INFO L280 TraceCheckUtils]: 0: Hoare triple {103#(and (= ULTIMATE.start_strlen_~s.base |ULTIMATE.start_main_#t~malloc22.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc22.base|) (* (- 1) ULTIMATE.start_strlen_~s.offset))))} call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); {123#(and (<= (+ ULTIMATE.start_strlen_~s.offset 1) (select |#length| ULTIMATE.start_strlen_~s.base)) (= ULTIMATE.start_strlen_~s.base |ULTIMATE.start_main_#t~malloc22.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc22.base|) (+ oldRank0 ULTIMATE.start_strlen_~s.offset)))} is VALID [2020-07-29 01:32:15,565 INFO L280 TraceCheckUtils]: 1: Hoare triple {123#(and (<= (+ ULTIMATE.start_strlen_~s.offset 1) (select |#length| ULTIMATE.start_strlen_~s.base)) (= ULTIMATE.start_strlen_~s.base |ULTIMATE.start_main_#t~malloc22.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc22.base|) (+ oldRank0 ULTIMATE.start_strlen_~s.offset)))} 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; {123#(and (<= (+ ULTIMATE.start_strlen_~s.offset 1) (select |#length| ULTIMATE.start_strlen_~s.base)) (= ULTIMATE.start_strlen_~s.base |ULTIMATE.start_main_#t~malloc22.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc22.base|) (+ oldRank0 ULTIMATE.start_strlen_~s.offset)))} is VALID [2020-07-29 01:32:15,566 INFO L280 TraceCheckUtils]: 2: Hoare triple {123#(and (<= (+ ULTIMATE.start_strlen_~s.offset 1) (select |#length| ULTIMATE.start_strlen_~s.base)) (= ULTIMATE.start_strlen_~s.base |ULTIMATE.start_main_#t~malloc22.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc22.base|) (+ oldRank0 ULTIMATE.start_strlen_~s.offset)))} 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; {105#(and (= ULTIMATE.start_strlen_~s.base |ULTIMATE.start_main_#t~malloc22.base|) (or unseeded (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc22.base|) (* (- 1) ULTIMATE.start_strlen_~s.offset))) (>= oldRank0 0))))} is VALID [2020-07-29 01:32:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:32:15,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:32:15,595 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:15,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:32:15,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,608 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:32:15,609 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 4 states. [2020-07-29 01:32:15,851 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 4 states. Result 90 states and 130 transitions. Complement of second has 7 states. [2020-07-29 01:32:15,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:32:15,852 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:15,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2020-07-29 01:32:15,860 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-07-29 01:32:15,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:15,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:15,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:32:15,876 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:32:15,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:15,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:15,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 130 transitions. [2020-07-29 01:32:15,884 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2020-07-29 01:32:15,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:15,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:15,890 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states. [2020-07-29 01:32:15,897 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-07-29 01:32:15,906 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2020-07-29 01:32:15,906 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:32:15,911 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:32:15,911 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:32:15,911 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 90 states and 130 transitions. cyclomatic complexity: 47 [2020-07-29 01:32:15,921 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 24 examples of accepted words. [2020-07-29 01:32:15,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:32:15,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:32:15,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:32:15,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:32:15,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:32:15,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:32:15,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:32:15,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:32:15,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:32:15,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 90 letters. Loop has 90 letters. [2020-07-29 01:32:15,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 90 letters. Loop has 90 letters. [2020-07-29 01:32:15,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 90 letters. Loop has 90 letters. [2020-07-29 01:32:15,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:32:15,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:32:15,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:32:15,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:15,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:15,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:32:15,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:32:15,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:32:15,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:32:15,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:32:15,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:32:15,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:32:15,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:32:15,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:32:15,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:32:15,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:32:15,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:32:15,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:32:15,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:32:15,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:32:15,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:32:15,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 13 letters. Loop has 7 letters. [2020-07-29 01:32:15,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 7 letters. [2020-07-29 01:32:15,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 13 letters. Loop has 7 letters. [2020-07-29 01:32:15,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:32:15,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:32:15,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:32:15,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:32:15,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:32:15,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:32:15,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:32:15,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:32:15,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:32:15,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:32:15,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:32:15,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:32:15,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:32:15,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:32:15,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:32:15,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:32:15,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:32:15,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:32:15,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:32:15,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:32:15,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:32:15,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:32:15,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:32:15,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:32:15,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:32:15,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:32:15,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:32:15,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:32:15,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:32:15,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:32:15,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:32:15,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:32:15,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:32:15,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 14 letters. Loop has 8 letters. [2020-07-29 01:32:15,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 8 letters. [2020-07-29 01:32:15,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 14 letters. Loop has 8 letters. [2020-07-29 01:32:15,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:32:15,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:32:15,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:32:15,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:32:15,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:32:15,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:32:15,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:32:15,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:32:15,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:32:15,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:32:15,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:32:15,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:32:15,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:32:15,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:32:15,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:32:15,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:32:15,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:32:15,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:32:15,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:32:15,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:32:15,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:32:15,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:32:15,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:32:15,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:32:15,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:32:15,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:32:15,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:32:15,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:32:15,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:32:15,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:32:15,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:32:15,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:32:15,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:32:15,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:32:15,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:32:15,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:32:15,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:32:15,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:32:15,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:32:15,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:32:15,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:32:15,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:32:15,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 16 letters. Loop has 7 letters. [2020-07-29 01:32:15,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 7 letters. [2020-07-29 01:32:15,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 16 letters. Loop has 7 letters. [2020-07-29 01:32:15,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:32:15,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:32:15,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:32:15,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 17 letters. Loop has 7 letters. [2020-07-29 01:32:15,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 7 letters. [2020-07-29 01:32:15,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 17 letters. Loop has 7 letters. [2020-07-29 01:32:15,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:32:15,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:32:15,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:32:15,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:32:15,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:32:15,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:32:15,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:32:15,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:32:15,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:32:15,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:32:15,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:32:15,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:32:15,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:32:15,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:32:15,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:32:15,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:32:15,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:32:15,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 90 states and 130 transitions. cyclomatic complexity: 47 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:32:15,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:15,998 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:16,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:32:16,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2020-07-29 01:32:16,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:32:16,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:16,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:32:16,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:16,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:32:16,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:16,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 130 transitions. cyclomatic complexity: 47 [2020-07-29 01:32:16,011 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2020-07-29 01:32:16,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 47 states and 62 transitions. [2020-07-29 01:32:16,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2020-07-29 01:32:16,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2020-07-29 01:32:16,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 62 transitions. [2020-07-29 01:32:16,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:32:16,024 INFO L688 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-07-29 01:32:16,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 62 transitions. [2020-07-29 01:32:16,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-29 01:32:16,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:32:16,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states and 62 transitions. Second operand 47 states. [2020-07-29 01:32:16,056 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states and 62 transitions. Second operand 47 states. [2020-07-29 01:32:16,058 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 47 states. [2020-07-29 01:32:16,061 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:16,065 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2020-07-29 01:32:16,066 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-07-29 01:32:16,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:16,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:16,067 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states and 62 transitions. [2020-07-29 01:32:16,067 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states and 62 transitions. [2020-07-29 01:32:16,068 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:16,072 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2020-07-29 01:32:16,073 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-07-29 01:32:16,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:16,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:16,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:32:16,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:32:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-29 01:32:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-07-29 01:32:16,078 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-07-29 01:32:16,078 INFO L591 BuchiCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-07-29 01:32:16,078 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:32:16,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 62 transitions. [2020-07-29 01:32:16,079 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2020-07-29 01:32:16,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:16,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:16,080 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:32:16,080 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:32:16,080 INFO L794 eck$LassoCheckResult]: Stem: 263#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 237#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; 238#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; 248#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; 255#L508 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 244#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; 245#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 257#L509-10 [2020-07-29 01:32:16,080 INFO L796 eck$LassoCheckResult]: Loop: 257#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 276#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; 277#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; 257#L509-10 [2020-07-29 01:32:16,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:16,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1806906284, now seen corresponding path program 1 times [2020-07-29 01:32:16,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:16,081 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739835855] [2020-07-29 01:32:16,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:16,151 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {485#true} is VALID [2020-07-29 01:32:16,151 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; {485#true} is VALID [2020-07-29 01:32:16,151 INFO L280 TraceCheckUtils]: 2: Hoare triple {485#true} 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; {485#true} is VALID [2020-07-29 01:32:16,153 INFO L280 TraceCheckUtils]: 3: Hoare triple {485#true} 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; {487#(not (= ULTIMATE.start_strlen_~s.base 0))} is VALID [2020-07-29 01:32:16,154 INFO L280 TraceCheckUtils]: 4: Hoare triple {487#(not (= ULTIMATE.start_strlen_~s.base 0))} assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; {486#false} is VALID [2020-07-29 01:32:16,154 INFO L280 TraceCheckUtils]: 5: Hoare triple {486#false} 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; {486#false} is VALID [2020-07-29 01:32:16,154 INFO L280 TraceCheckUtils]: 6: Hoare triple {486#false} assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; {486#false} is VALID [2020-07-29 01:32:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:32:16,156 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739835855] [2020-07-29 01:32:16,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:32:16,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:32:16,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583848092] [2020-07-29 01:32:16,161 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:32:16,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:16,161 INFO L82 PathProgramCache]: Analyzing trace with hash 72652, now seen corresponding path program 1 times [2020-07-29 01:32:16,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:16,162 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962403662] [2020-07-29 01:32:16,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:16,167 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:16,176 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:16,182 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:16,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:32:16,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:32:16,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:32:16,246 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. cyclomatic complexity: 20 Second operand 3 states. [2020-07-29 01:32:16,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:32:16,320 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2020-07-29 01:32:16,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:32:16,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:32:16,334 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:16,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2020-07-29 01:32:16,337 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-29 01:32:16,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 36 transitions. [2020-07-29 01:32:16,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-07-29 01:32:16,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-07-29 01:32:16,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2020-07-29 01:32:16,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:32:16,339 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-07-29 01:32:16,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2020-07-29 01:32:16,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-29 01:32:16,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:32:16,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states and 36 transitions. Second operand 29 states. [2020-07-29 01:32:16,342 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states and 36 transitions. Second operand 29 states. [2020-07-29 01:32:16,342 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand 29 states. [2020-07-29 01:32:16,342 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:16,344 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2020-07-29 01:32:16,344 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2020-07-29 01:32:16,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:16,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:16,345 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states and 36 transitions. [2020-07-29 01:32:16,345 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states and 36 transitions. [2020-07-29 01:32:16,346 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:16,348 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2020-07-29 01:32:16,348 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2020-07-29 01:32:16,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:16,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:16,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:32:16,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:32:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-29 01:32:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2020-07-29 01:32:16,350 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-07-29 01:32:16,350 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-07-29 01:32:16,350 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:32:16,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2020-07-29 01:32:16,351 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-07-29 01:32:16,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:16,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:16,352 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:32:16,352 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:32:16,352 INFO L794 eck$LassoCheckResult]: Stem: 546#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 524#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; 525#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; 533#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; 540#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 541#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 543#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 545#L509-5 strlen_#res := strlen_~i~0; 530#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; 531#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 527#L509-10 [2020-07-29 01:32:16,352 INFO L796 eck$LassoCheckResult]: Loop: 527#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 532#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; 526#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; 527#L509-10 [2020-07-29 01:32:16,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:16,353 INFO L82 PathProgramCache]: Analyzing trace with hash 764823385, now seen corresponding path program 1 times [2020-07-29 01:32:16,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:16,353 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36682663] [2020-07-29 01:32:16,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:16,373 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:16,393 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:16,401 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:16,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:16,401 INFO L82 PathProgramCache]: Analyzing trace with hash 72652, now seen corresponding path program 2 times [2020-07-29 01:32:16,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:16,402 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516507332] [2020-07-29 01:32:16,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:16,407 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:16,411 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:16,413 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:16,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:16,413 INFO L82 PathProgramCache]: Analyzing trace with hash 52000116, now seen corresponding path program 1 times [2020-07-29 01:32:16,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:16,414 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61313533] [2020-07-29 01:32:16,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:16,443 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:16,477 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:16,488 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:17,140 WARN L193 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 115 [2020-07-29 01:32:17,318 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-07-29 01:32:17,320 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:32:17,321 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:32:17,321 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:32:17,321 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:32:17,321 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:32:17,321 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:17,321 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:32:17,321 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:32:17,321 INFO L133 ssoRankerPreferences]: Filename of dumped script: strstr.i_Iteration3_Lasso [2020-07-29 01:32:17,321 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:32:17,321 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:32:17,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,702 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2020-07-29 01:32:17,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:17,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:32:18,875 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:32:18,876 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:18,884 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 [2020-07-29 01:32:18,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:18,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:18,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:18,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:18,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:18,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:18,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:18,890 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:18,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:18,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:18,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:18,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:18,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:18,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:18,919 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:18,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:18,920 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:18,944 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 [2020-07-29 01:32:18,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:18,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:18,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:18,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:18,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:18,946 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:18,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:18,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:18,973 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 [2020-07-29 01:32:18,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:18,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:18,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:18,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:18,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:18,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:18,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:18,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:19,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:19,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:19,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:19,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:19,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:19,005 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:19,005 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:19,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:19,035 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 [2020-07-29 01:32:19,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:19,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:19,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:19,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:19,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:19,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:19,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:19,039 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:19,064 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 [2020-07-29 01:32:19,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:19,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:19,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:19,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:19,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:19,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:19,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:19,118 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 [2020-07-29 01:32:19,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:19,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:19,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:19,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:19,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:19,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:19,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:19,123 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:19,146 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 [2020-07-29 01:32:19,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:19,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:19,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:19,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:19,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:19,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:32:19,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:19,150 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:19,177 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 [2020-07-29 01:32:19,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:19,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:19,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:19,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:19,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:19,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:19,185 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:19,215 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 [2020-07-29 01:32:19,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:19,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:19,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:19,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:19,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:19,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:19,226 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:32:19,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:19,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:19,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:19,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:19,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:19,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:19,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:19,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:19,287 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:32:19,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:19,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:19,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:19,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:19,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:19,292 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:19,300 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:19,325 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 [2020-07-29 01:32:19,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:19,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:19,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:19,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:19,329 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:19,330 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:19,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:19,359 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 [2020-07-29 01:32:19,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:19,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:32:19,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:19,361 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:32:19,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:19,362 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:32:19,362 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:32:19,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:19,419 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 [2020-07-29 01:32:19,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:32:19,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:32:19,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:32:19,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:32:19,430 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:32:19,430 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:32:19,445 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:32:19,466 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-07-29 01:32:19,467 INFO L444 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:32:19,469 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:32:19,471 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:32:19,472 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:32:19,472 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc20.base)_2, ULTIMATE.start_strlen_~s.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc20.base)_2 - 1*ULTIMATE.start_strlen_~s.offset Supporting invariants [] [2020-07-29 01:32:19,545 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2020-07-29 01:32:19,550 INFO L393 LassoCheck]: Loop: "call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 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;" "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;" [2020-07-29 01:32:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:19,559 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:32:19,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:19,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:32:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:19,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:19,663 INFO L280 TraceCheckUtils]: 0: Hoare triple {687#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {687#unseeded} is VALID [2020-07-29 01:32:19,664 INFO L280 TraceCheckUtils]: 1: Hoare triple {687#unseeded} 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; {687#unseeded} is VALID [2020-07-29 01:32:19,665 INFO L280 TraceCheckUtils]: 2: Hoare triple {687#unseeded} 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; {776#(and (= ULTIMATE.start_main_~hay~0.base |ULTIMATE.start_main_#t~malloc20.base|) unseeded)} is VALID [2020-07-29 01:32:19,666 INFO L280 TraceCheckUtils]: 3: Hoare triple {776#(and (= ULTIMATE.start_main_~hay~0.base |ULTIMATE.start_main_#t~malloc20.base|) unseeded)} 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; {780#(and (= ULTIMATE.start_strstr_~haystack.base |ULTIMATE.start_main_#t~malloc20.base|) unseeded)} is VALID [2020-07-29 01:32:19,666 INFO L280 TraceCheckUtils]: 4: Hoare triple {780#(and (= ULTIMATE.start_strstr_~haystack.base |ULTIMATE.start_main_#t~malloc20.base|) unseeded)} assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; {780#(and (= ULTIMATE.start_strstr_~haystack.base |ULTIMATE.start_main_#t~malloc20.base|) unseeded)} is VALID [2020-07-29 01:32:19,667 INFO L280 TraceCheckUtils]: 5: Hoare triple {780#(and (= ULTIMATE.start_strstr_~haystack.base |ULTIMATE.start_main_#t~malloc20.base|) unseeded)} call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); {780#(and (= ULTIMATE.start_strstr_~haystack.base |ULTIMATE.start_main_#t~malloc20.base|) unseeded)} is VALID [2020-07-29 01:32:19,672 INFO L280 TraceCheckUtils]: 6: Hoare triple {780#(and (= ULTIMATE.start_strstr_~haystack.base |ULTIMATE.start_main_#t~malloc20.base|) unseeded)} assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; {780#(and (= ULTIMATE.start_strstr_~haystack.base |ULTIMATE.start_main_#t~malloc20.base|) unseeded)} is VALID [2020-07-29 01:32:19,673 INFO L280 TraceCheckUtils]: 7: Hoare triple {780#(and (= ULTIMATE.start_strstr_~haystack.base |ULTIMATE.start_main_#t~malloc20.base|) unseeded)} strlen_#res := strlen_~i~0; {780#(and (= ULTIMATE.start_strstr_~haystack.base |ULTIMATE.start_main_#t~malloc20.base|) unseeded)} is VALID [2020-07-29 01:32:19,673 INFO L280 TraceCheckUtils]: 8: Hoare triple {780#(and (= ULTIMATE.start_strstr_~haystack.base |ULTIMATE.start_main_#t~malloc20.base|) unseeded)} 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; {761#(and (= ULTIMATE.start_strlen_~s.base |ULTIMATE.start_main_#t~malloc20.base|) unseeded)} is VALID [2020-07-29 01:32:19,674 INFO L280 TraceCheckUtils]: 9: Hoare triple {761#(and (= ULTIMATE.start_strlen_~s.base |ULTIMATE.start_main_#t~malloc20.base|) unseeded)} assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; {761#(and (= ULTIMATE.start_strlen_~s.base |ULTIMATE.start_main_#t~malloc20.base|) unseeded)} is VALID [2020-07-29 01:32:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:19,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:32:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:19,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:32:19,716 INFO L280 TraceCheckUtils]: 0: Hoare triple {762#(and (= ULTIMATE.start_strlen_~s.base |ULTIMATE.start_main_#t~malloc20.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc20.base|) (* (- 1) ULTIMATE.start_strlen_~s.offset))))} call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); {799#(and (<= (+ ULTIMATE.start_strlen_~s.offset 1) (select |#length| ULTIMATE.start_strlen_~s.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc20.base|) (+ oldRank0 ULTIMATE.start_strlen_~s.offset)) (= ULTIMATE.start_strlen_~s.base |ULTIMATE.start_main_#t~malloc20.base|))} is VALID [2020-07-29 01:32:19,717 INFO L280 TraceCheckUtils]: 1: Hoare triple {799#(and (<= (+ ULTIMATE.start_strlen_~s.offset 1) (select |#length| ULTIMATE.start_strlen_~s.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc20.base|) (+ oldRank0 ULTIMATE.start_strlen_~s.offset)) (= ULTIMATE.start_strlen_~s.base |ULTIMATE.start_main_#t~malloc20.base|))} 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; {799#(and (<= (+ ULTIMATE.start_strlen_~s.offset 1) (select |#length| ULTIMATE.start_strlen_~s.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc20.base|) (+ oldRank0 ULTIMATE.start_strlen_~s.offset)) (= ULTIMATE.start_strlen_~s.base |ULTIMATE.start_main_#t~malloc20.base|))} is VALID [2020-07-29 01:32:19,718 INFO L280 TraceCheckUtils]: 2: Hoare triple {799#(and (<= (+ ULTIMATE.start_strlen_~s.offset 1) (select |#length| ULTIMATE.start_strlen_~s.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc20.base|) (+ oldRank0 ULTIMATE.start_strlen_~s.offset)) (= ULTIMATE.start_strlen_~s.base |ULTIMATE.start_main_#t~malloc20.base|))} 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; {764#(and (= ULTIMATE.start_strlen_~s.base |ULTIMATE.start_main_#t~malloc20.base|) (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc20.base|) (* (- 1) ULTIMATE.start_strlen_~s.offset))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:32:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:32:19,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:32:19,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:19,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:32:19,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:19,737 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2020-07-29 01:32:19,737 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 36 transitions. cyclomatic complexity: 10 Second operand 6 states. [2020-07-29 01:32:20,033 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 36 transitions. cyclomatic complexity: 10. Second operand 6 states. Result 57 states and 72 transitions. Complement of second has 7 states. [2020-07-29 01:32:20,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 4 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:32:20,034 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:20,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. cyclomatic complexity: 10 [2020-07-29 01:32:20,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:20,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:20,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 01:32:20,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:32:20,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:20,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:20,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 72 transitions. [2020-07-29 01:32:20,038 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2020-07-29 01:32:20,038 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:20,038 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:20,038 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 36 transitions. cyclomatic complexity: 10 [2020-07-29 01:32:20,040 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 01:32:20,041 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 01:32:20,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:32:20,042 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:32:20,043 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 57 states and 72 transitions. cyclomatic complexity: 20 [2020-07-29 01:32:20,045 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 18 examples of accepted words. [2020-07-29 01:32:20,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:32:20,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:32:20,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:32:20,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:32:20,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:32:20,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:32:20,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:32:20,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:32:20,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:32:20,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 57 letters. Loop has 57 letters. [2020-07-29 01:32:20,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 57 letters. Loop has 57 letters. [2020-07-29 01:32:20,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 57 letters. Loop has 57 letters. [2020-07-29 01:32:20,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:32:20,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:32:20,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:32:20,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:20,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:20,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:32:20,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:32:20,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:32:20,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:32:20,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:32:20,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:32:20,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:32:20,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:32:20,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:32:20,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:32:20,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 8 letters. [2020-07-29 01:32:20,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 17 letters. Loop has 8 letters. [2020-07-29 01:32:20,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 17 letters. Loop has 8 letters. [2020-07-29 01:32:20,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:32:20,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:32:20,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:32:20,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:32:20,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:32:20,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:32:20,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:32:20,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:32:20,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:32:20,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:32:20,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:32:20,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:32:20,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 8 letters. [2020-07-29 01:32:20,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 18 letters. Loop has 8 letters. [2020-07-29 01:32:20,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 18 letters. Loop has 8 letters. [2020-07-29 01:32:20,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:32:20,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:32:20,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:32:20,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:32:20,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:32:20,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:32:20,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:32:20,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:32:20,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:32:20,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:32:20,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:32:20,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:32:20,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:32:20,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:32:20,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 18 letters. Loop has 4 letters. [2020-07-29 01:32:20,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:32:20,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:32:20,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:32:20,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:32:20,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:32:20,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 19 letters. Loop has 4 letters. [2020-07-29 01:32:20,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:32:20,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:32:20,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:32:20,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 8 letters. [2020-07-29 01:32:20,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 20 letters. Loop has 8 letters. [2020-07-29 01:32:20,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 20 letters. Loop has 8 letters. [2020-07-29 01:32:20,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:32:20,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:32:20,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:32:20,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:32:20,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:32:20,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:32:20,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 21 letters. Loop has 8 letters. [2020-07-29 01:32:20,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 21 letters. Loop has 8 letters. [2020-07-29 01:32:20,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 21 letters. Loop has 8 letters. [2020-07-29 01:32:20,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:32:20,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:32:20,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:32:20,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:32:20,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:32:20,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:32:20,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:32:20,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:32:20,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:32:20,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:32:20,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:32:20,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:32:20,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:32:20,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:32:20,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:32:20,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:32:20,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:32:20,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:32:20,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 8 letters. [2020-07-29 01:32:20,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 17 letters. Loop has 8 letters. [2020-07-29 01:32:20,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 17 letters. Loop has 8 letters. [2020-07-29 01:32:20,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:32:20,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:32:20,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:32:20,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:32:20,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:32:20,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:32:20,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 8 letters. [2020-07-29 01:32:20,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 18 letters. Loop has 8 letters. [2020-07-29 01:32:20,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 20 Stem has 18 letters. Loop has 8 letters. [2020-07-29 01:32:20,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,089 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:32:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:32:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2020-07-29 01:32:20,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:32:20,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:32:20,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:32:20,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:32:20,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 72 transitions. cyclomatic complexity: 20 [2020-07-29 01:32:20,094 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2020-07-29 01:32:20,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 43 states and 54 transitions. [2020-07-29 01:32:20,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2020-07-29 01:32:20,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-07-29 01:32:20,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2020-07-29 01:32:20,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:32:20,097 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2020-07-29 01:32:20,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2020-07-29 01:32:20,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2020-07-29 01:32:20,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:32:20,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states and 54 transitions. Second operand 31 states. [2020-07-29 01:32:20,100 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states and 54 transitions. Second operand 31 states. [2020-07-29 01:32:20,101 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand 31 states. [2020-07-29 01:32:20,101 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:20,104 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2020-07-29 01:32:20,104 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2020-07-29 01:32:20,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:20,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:20,105 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 43 states and 54 transitions. [2020-07-29 01:32:20,105 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 43 states and 54 transitions. [2020-07-29 01:32:20,105 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:20,108 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2020-07-29 01:32:20,108 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2020-07-29 01:32:20,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:20,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:20,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:32:20,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:32:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-29 01:32:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2020-07-29 01:32:20,111 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2020-07-29 01:32:20,111 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2020-07-29 01:32:20,111 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:32:20,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2020-07-29 01:32:20,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:32:20,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:20,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:20,113 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:32:20,113 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:32:20,113 INFO L794 eck$LassoCheckResult]: Stem: 907#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 887#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; 888#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; 896#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; 901#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 902#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 904#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 906#L509-5 strlen_#res := strlen_~i~0; 889#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; 890#L508-2 assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; 894#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 895#L529 assume !(0 == strstr_~nl~0 % 4294967296); 897#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 898#L531-3 [2020-07-29 01:32:20,114 INFO L796 eck$LassoCheckResult]: Loop: 898#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; 885#L532 assume !strstr_#t~short17; 886#L532-2 assume !strstr_#t~short17;havoc strstr_#t~mem15;havoc strstr_#t~mem14;havoc strstr_#t~short17;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 900#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 898#L531-3 [2020-07-29 01:32:20,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:20,114 INFO L82 PathProgramCache]: Analyzing trace with hash 51953446, now seen corresponding path program 1 times [2020-07-29 01:32:20,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:20,115 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030993451] [2020-07-29 01:32:20,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:20,195 INFO L280 TraceCheckUtils]: 0: Hoare triple {1084#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1084#true} is VALID [2020-07-29 01:32:20,195 INFO L280 TraceCheckUtils]: 1: Hoare triple {1084#true} havoc main_#res;havoc main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~ret23.base, main_#t~ret23.offset, main_~in_len~0, main_~hay~0.base, main_~hay~0.offset, main_~out_len~0, main_~needle~0.base, main_~needle~0.offset;main_~in_len~0 := main_#t~nondet19;havoc main_#t~nondet19; {1084#true} is VALID [2020-07-29 01:32:20,196 INFO L280 TraceCheckUtils]: 2: Hoare triple {1084#true} 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; {1086#(not (= 0 ULTIMATE.start_main_~hay~0.base))} is VALID [2020-07-29 01:32:20,198 INFO L280 TraceCheckUtils]: 3: Hoare triple {1086#(not (= 0 ULTIMATE.start_main_~hay~0.base))} 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; {1087#(not (= 0 ULTIMATE.start_strstr_~haystack.base))} is VALID [2020-07-29 01:32:20,198 INFO L280 TraceCheckUtils]: 4: Hoare triple {1087#(not (= 0 ULTIMATE.start_strstr_~haystack.base))} assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; {1087#(not (= 0 ULTIMATE.start_strstr_~haystack.base))} is VALID [2020-07-29 01:32:20,199 INFO L280 TraceCheckUtils]: 5: Hoare triple {1087#(not (= 0 ULTIMATE.start_strstr_~haystack.base))} call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); {1087#(not (= 0 ULTIMATE.start_strstr_~haystack.base))} is VALID [2020-07-29 01:32:20,200 INFO L280 TraceCheckUtils]: 6: Hoare triple {1087#(not (= 0 ULTIMATE.start_strstr_~haystack.base))} assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; {1087#(not (= 0 ULTIMATE.start_strstr_~haystack.base))} is VALID [2020-07-29 01:32:20,201 INFO L280 TraceCheckUtils]: 7: Hoare triple {1087#(not (= 0 ULTIMATE.start_strstr_~haystack.base))} strlen_#res := strlen_~i~0; {1087#(not (= 0 ULTIMATE.start_strstr_~haystack.base))} is VALID [2020-07-29 01:32:20,201 INFO L280 TraceCheckUtils]: 8: Hoare triple {1087#(not (= 0 ULTIMATE.start_strstr_~haystack.base))} 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; {1088#(not (= ULTIMATE.start_strlen_~s.base 0))} is VALID [2020-07-29 01:32:20,202 INFO L280 TraceCheckUtils]: 9: Hoare triple {1088#(not (= ULTIMATE.start_strlen_~s.base 0))} assume strlen_~s.base == 0 && strlen_~s.offset == 0;strlen_#res := 0; {1085#false} is VALID [2020-07-29 01:32:20,202 INFO L280 TraceCheckUtils]: 10: Hoare triple {1085#false} strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; {1085#false} is VALID [2020-07-29 01:32:20,202 INFO L280 TraceCheckUtils]: 11: Hoare triple {1085#false} assume !(0 == strstr_~nl~0 % 4294967296); {1085#false} is VALID [2020-07-29 01:32:20,203 INFO L280 TraceCheckUtils]: 12: Hoare triple {1085#false} assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); {1085#false} is VALID [2020-07-29 01:32:20,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:32:20,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030993451] [2020-07-29 01:32:20,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:32:20,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:32:20,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781431782] [2020-07-29 01:32:20,204 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:32:20,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:20,205 INFO L82 PathProgramCache]: Analyzing trace with hash 3227613, now seen corresponding path program 1 times [2020-07-29 01:32:20,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:20,205 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680661678] [2020-07-29 01:32:20,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:20,213 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:32:20,219 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:32:20,222 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:32:20,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:32:20,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:32:20,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:32:20,346 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 11 Second operand 5 states. [2020-07-29 01:32:20,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:32:20,465 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2020-07-29 01:32:20,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:32:20,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:32:20,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:32:20,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2020-07-29 01:32:20,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:32:20,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 38 transitions. [2020-07-29 01:32:20,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-07-29 01:32:20,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-07-29 01:32:20,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 38 transitions. [2020-07-29 01:32:20,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:32:20,488 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-07-29 01:32:20,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 38 transitions. [2020-07-29 01:32:20,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-29 01:32:20,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:32:20,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 38 transitions. Second operand 31 states. [2020-07-29 01:32:20,490 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 38 transitions. Second operand 31 states. [2020-07-29 01:32:20,491 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 31 states. [2020-07-29 01:32:20,491 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:20,493 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2020-07-29 01:32:20,493 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2020-07-29 01:32:20,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:20,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:20,494 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states and 38 transitions. [2020-07-29 01:32:20,494 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states and 38 transitions. [2020-07-29 01:32:20,495 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:32:20,496 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2020-07-29 01:32:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2020-07-29 01:32:20,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:32:20,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:32:20,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:32:20,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:32:20,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-29 01:32:20,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2020-07-29 01:32:20,499 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-07-29 01:32:20,499 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-07-29 01:32:20,499 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:32:20,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2020-07-29 01:32:20,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:32:20,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:32:20,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:32:20,501 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:32:20,501 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:32:20,501 INFO L794 eck$LassoCheckResult]: Stem: 1153#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1129#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; 1130#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; 1140#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; 1147#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1148#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1150#L509-1 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1152#L509-5 strlen_#res := strlen_~i~0; 1135#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; 1136#L508-2 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 1137#L509-10 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 1139#L509-7 assume !(0 != strlen_#t~mem4);havoc strlen_#t~mem4; 1143#L509-11 strlen_#res := strlen_~i~0; 1141#L510-1 strstr_#t~ret12 := strlen_#res;strstr_~hl~0 := strstr_#t~ret12;havoc strstr_#t~ret12;havoc strstr_~i~1; 1142#L529 assume !(0 == strstr_~nl~0 % 4294967296); 1144#L530 assume !(strstr_~nl~0 % 4294967296 > strstr_~hl~0 % 4294967296);strstr_~i~1 := 1 + (strstr_~hl~0 - strstr_~nl~0); 1145#L531-3 [2020-07-29 01:32:20,501 INFO L796 eck$LassoCheckResult]: Loop: 1145#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; 1133#L532 assume !strstr_#t~short17; 1134#L532-2 assume !strstr_#t~short17;havoc strstr_#t~mem15;havoc strstr_#t~mem14;havoc strstr_#t~short17;havoc strstr_#t~ret16;strstr_#t~pre18.base, strstr_#t~pre18.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;strstr_~haystack.base, strstr_~haystack.offset := strstr_~haystack.base, 1 + strstr_~haystack.offset;havoc strstr_#t~pre18.base, strstr_#t~pre18.offset; 1146#L531-2 strstr_#t~pre13 := strstr_~i~1 - 1;strstr_~i~1 := strstr_~i~1 - 1;havoc strstr_#t~pre13; 1145#L531-3 [2020-07-29 01:32:20,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:32:20,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1349410205, now seen corresponding path program 1 times [2020-07-29 01:32:20,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:32:20,503 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313330079] [2020-07-29 01:32:20,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:32:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:32:20,540 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.ProofTermGenerator.convert(ProofTermGenerator.java:150) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getProof(SMTInterpol.java:797) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:928) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkStemFeasibility(LassoCheck.java:883) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:797) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-29 01:32:20,547 INFO L168 Benchmark]: Toolchain (without parser) took 10185.02 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 321.4 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 145.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:20,549 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:32:20,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 597.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -171.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:20,552 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:20,553 INFO L168 Benchmark]: Boogie Preprocessor took 36.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:32:20,554 INFO L168 Benchmark]: RCFGBuilder took 635.97 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: 37.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:20,554 INFO L168 Benchmark]: BuchiAutomizer took 8841.16 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -61.1 MB). Peak memory consumption was 116.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:32:20,561 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 597.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -171.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 635.97 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: 37.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8841.16 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -61.1 MB). Peak memory consumption was 116.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...