./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/openbsd_cstrstr-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash bbb28681f649db641abcf0a1b656085d04f9cc91 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_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 03:26:27,494 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:26:27,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:26:27,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:26:27,517 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:26:27,519 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:26:27,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:26:27,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:26:27,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:26:27,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:26:27,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:26:27,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:26:27,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:26:27,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:26:27,551 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:26:27,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:26:27,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:26:27,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:26:27,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:26:27,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:26:27,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:26:27,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:26:27,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:26:27,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:26:27,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:26:27,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:26:27,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:26:27,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:26:27,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:26:27,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:26:27,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:26:27,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:26:27,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:26:27,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:26:27,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:26:27,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:26:27,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:26:27,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:26:27,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:26:27,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:26:27,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:26:27,592 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:26:27,635 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:26:27,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:26:27,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:26:27,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:26:27,640 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:26:27,640 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:26:27,641 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:26:27,641 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:26:27,641 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:26:27,641 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:26:27,641 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:26:27,642 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:26:27,642 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:26:27,642 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:26:27,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:26:27,643 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:26:27,644 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:26:27,644 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:26:27,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:26:27,644 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:26:27,644 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:26:27,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:26:27,645 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:26:27,645 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:26:27,645 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:26:27,645 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:26:27,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:26:27,646 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:26:27,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:26:27,647 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:26:27,647 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:26:27,648 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:26:27,649 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:26:27,650 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bbb28681f649db641abcf0a1b656085d04f9cc91 [2020-07-29 03:26:27,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:26:27,972 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:26:27,976 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:26:27,977 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:26:27,978 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:26:27,979 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2020-07-29 03:26:28,059 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2af0ba659/0683898bbfdd4af087d0c80f260d5d54/FLAG5eb36ef9d [2020-07-29 03:26:28,645 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:26:28,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrstr-alloca-2.i [2020-07-29 03:26:28,658 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2af0ba659/0683898bbfdd4af087d0c80f260d5d54/FLAG5eb36ef9d [2020-07-29 03:26:28,938 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2af0ba659/0683898bbfdd4af087d0c80f260d5d54 [2020-07-29 03:26:28,942 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:26:28,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:26:28,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:26:28,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:26:28,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:26:28,953 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:26:28" (1/1) ... [2020-07-29 03:26:28,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a052b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:28, skipping insertion in model container [2020-07-29 03:26:28,956 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:26:28" (1/1) ... [2020-07-29 03:26:28,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:26:29,007 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:26:29,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:26:29,541 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:26:29,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:26:29,697 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:26:29,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:29 WrapperNode [2020-07-29 03:26:29,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:26:29,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:26:29,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:26:29,702 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:26:29,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:29" (1/1) ... [2020-07-29 03:26:29,724 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:29" (1/1) ... [2020-07-29 03:26:29,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:26:29,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:26:29,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:26:29,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:26:29,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:29" (1/1) ... [2020-07-29 03:26:29,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:29" (1/1) ... [2020-07-29 03:26:29,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:29" (1/1) ... [2020-07-29 03:26:29,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:29" (1/1) ... [2020-07-29 03:26:29,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:29" (1/1) ... [2020-07-29 03:26:29,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:29" (1/1) ... [2020-07-29 03:26:29,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:29" (1/1) ... [2020-07-29 03:26:29,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:26:29,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:26:29,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:26:29,798 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:26:29,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:29" (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 03:26:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:26:29,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:26:29,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:26:29,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:26:29,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:26:29,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:26:30,457 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:26:30,458 INFO L295 CfgBuilder]: Removed 16 assume(true) statements. [2020-07-29 03:26:30,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:30 BoogieIcfgContainer [2020-07-29 03:26:30,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:26:30,462 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:26:30,462 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:26:30,466 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:26:30,467 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:30,467 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:26:28" (1/3) ... [2020-07-29 03:26:30,468 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@171b51c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:26:30, skipping insertion in model container [2020-07-29 03:26:30,468 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:30,468 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:29" (2/3) ... [2020-07-29 03:26:30,469 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@171b51c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:26:30, skipping insertion in model container [2020-07-29 03:26:30,469 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:30,470 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:30" (3/3) ... [2020-07-29 03:26:30,472 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrstr-alloca-2.i [2020-07-29 03:26:30,521 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:26:30,521 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:26:30,521 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:26:30,521 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:26:30,522 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:26:30,522 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:26:30,522 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:26:30,522 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:26:30,537 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2020-07-29 03:26:30,569 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2020-07-29 03:26:30,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:30,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:30,574 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:26:30,574 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:30,574 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:26:30,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2020-07-29 03:26:30,581 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2020-07-29 03:26:30,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:30,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:30,582 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:26:30,582 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:30,589 INFO L794 eck$LassoCheckResult]: Stem: 29#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 4#L555true assume !(main_~length1~0 < 1); 28#L555-2true assume !(main_~length2~0 < 1); 19#L558-1true call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 35#L564-3true [2020-07-29 03:26:30,589 INFO L796 eck$LassoCheckResult]: Loop: 35#L564-3true assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 32#L564-2true main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 35#L564-3true [2020-07-29 03:26:30,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:30,594 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-07-29 03:26:30,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:30,602 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214195700] [2020-07-29 03:26:30,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:30,691 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:30,706 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:30,728 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:30,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:30,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2020-07-29 03:26:30,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:30,730 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627606793] [2020-07-29 03:26:30,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:30,742 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:30,751 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:30,756 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:30,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:30,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2020-07-29 03:26:30,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:30,759 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685063694] [2020-07-29 03:26:30,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:30,796 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:30,814 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:30,820 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:31,075 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-07-29 03:26:31,190 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:31,191 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:31,192 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:31,192 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:31,192 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:31,192 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:31,193 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:31,193 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:31,193 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration1_Lasso [2020-07-29 03:26:31,193 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:31,194 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:31,241 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 03:26:31,250 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 03:26:31,254 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 03:26:31,259 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 03:26:31,263 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 03:26:31,267 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 03:26:31,273 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 03:26:31,279 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 03:26:31,283 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 03:26:31,288 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 03:26:31,450 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-07-29 03:26:31,485 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 03:26:31,497 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 03:26:31,501 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 03:26:31,508 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 03:26:31,513 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 03:26:31,520 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 03:26:32,187 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:32,193 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) [2020-07-29 03:26:32,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:32,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:32,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:32,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:32,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:32,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:32,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:32,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:32,223 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:32,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:32,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:32,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:32,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:32,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:32,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:32,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:32,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:32,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:32,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:32,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:32,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:32,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:32,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:32,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:32,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:32,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:32,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:26:32,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:32,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:32,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:32,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:32,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:32,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:32,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:32,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:32,349 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 03:26:32,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:32,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:32,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:32,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:32,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:32,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:32,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:32,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:32,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:32,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:32,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:32,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:32,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:32,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:32,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:32,471 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:32,481 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 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 03:26:32,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:32,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:32,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:32,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:32,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:32,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:32,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:32,523 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 03:26:32,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:32,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:32,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:32,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:32,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:32,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:32,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:32,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:32,554 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 03:26:32,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:32,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:32,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:32,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:32,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:32,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:32,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:32,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:26:32,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:32,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:32,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:32,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:32,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:32,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:32,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:32,639 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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:32,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:32,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:32,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:32,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:32,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:32,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:32,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:32,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:32,668 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:26:32,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:32,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:32,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:32,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:32,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:32,709 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:32,710 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:32,724 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:32,855 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-07-29 03:26:32,856 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. 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) [2020-07-29 03:26:32,905 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:32,912 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:32,912 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:32,913 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-07-29 03:26:32,974 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:26:32,979 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25;" "main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24;" [2020-07-29 03:26:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:33,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:33,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:26:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:33,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:33,083 INFO L280 TraceCheckUtils]: 0: Hoare triple {47#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {47#unseeded} is VALID [2020-07-29 03:26:33,084 INFO L280 TraceCheckUtils]: 1: Hoare triple {47#unseeded} havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; {47#unseeded} is VALID [2020-07-29 03:26:33,085 INFO L280 TraceCheckUtils]: 2: Hoare triple {47#unseeded} assume !(main_~length1~0 < 1); {47#unseeded} is VALID [2020-07-29 03:26:33,086 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#unseeded} assume !(main_~length2~0 < 1); {47#unseeded} is VALID [2020-07-29 03:26:33,087 INFO L280 TraceCheckUtils]: 4: Hoare triple {47#unseeded} call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; {47#unseeded} is VALID [2020-07-29 03:26:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:33,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:26:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:33,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:33,126 INFO L280 TraceCheckUtils]: 0: Hoare triple {50#(>= oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_main_~i~0)))} assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; {107#(and (<= ULTIMATE.start_main_~length1~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length1~0))} is VALID [2020-07-29 03:26:33,127 INFO L280 TraceCheckUtils]: 1: Hoare triple {107#(and (<= ULTIMATE.start_main_~length1~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length1~0))} main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; {90#(or (and (> oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_main_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:26:33,128 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 03:26:33,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:33,153 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 03:26:33,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:33,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,165 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:26:33,167 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states. Second operand 3 states. [2020-07-29 03:26:33,415 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states.. Second operand 3 states. Result 99 states and 145 transitions. Complement of second has 7 states. [2020-07-29 03:26:33,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:33,416 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:33,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states. [2020-07-29 03:26:33,421 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2020-07-29 03:26:33,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:33,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:33,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:26:33,430 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:26:33,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:33,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:33,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 145 transitions. [2020-07-29 03:26:33,442 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2020-07-29 03:26:33,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:33,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:33,445 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states. [2020-07-29 03:26:33,448 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2020-07-29 03:26:33,457 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 21 examples of accepted words. [2020-07-29 03:26:33,457 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:26:33,460 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:26:33,461 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:26:33,461 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 99 states and 145 transitions. cyclomatic complexity: 56 [2020-07-29 03:26:33,467 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 19 examples of accepted words. [2020-07-29 03:26:33,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:33,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:33,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:33,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:33,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:33,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:33,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:33,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:33,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:33,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 99 letters. Loop has 99 letters. [2020-07-29 03:26:33,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 99 letters. Loop has 99 letters. [2020-07-29 03:26:33,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 99 letters. Loop has 99 letters. [2020-07-29 03:26:33,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 37 letters. Loop has 37 letters. [2020-07-29 03:26:33,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 37 letters. [2020-07-29 03:26:33,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 37 letters. Loop has 37 letters. [2020-07-29 03:26:33,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:33,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:33,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:33,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 18 letters. Loop has 6 letters. [2020-07-29 03:26:33,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 6 letters. [2020-07-29 03:26:33,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 18 letters. Loop has 6 letters. [2020-07-29 03:26:33,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:33,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:33,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:33,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 17 letters. Loop has 6 letters. [2020-07-29 03:26:33,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 6 letters. [2020-07-29 03:26:33,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 17 letters. Loop has 6 letters. [2020-07-29 03:26:33,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 03:26:33,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 03:26:33,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 13 letters. Loop has 6 letters. [2020-07-29 03:26:33,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:33,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:33,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:33,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 19 letters. Loop has 5 letters. [2020-07-29 03:26:33,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 5 letters. [2020-07-29 03:26:33,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 19 letters. Loop has 5 letters. [2020-07-29 03:26:33,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 18 letters. Loop has 5 letters. [2020-07-29 03:26:33,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 5 letters. [2020-07-29 03:26:33,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 18 letters. Loop has 5 letters. [2020-07-29 03:26:33,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 20 letters. Loop has 5 letters. [2020-07-29 03:26:33,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 5 letters. [2020-07-29 03:26:33,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 20 letters. Loop has 5 letters. [2020-07-29 03:26:33,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 16 letters. Loop has 6 letters. [2020-07-29 03:26:33,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 6 letters. [2020-07-29 03:26:33,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 16 letters. Loop has 6 letters. [2020-07-29 03:26:33,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 21 letters. Loop has 5 letters. [2020-07-29 03:26:33,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 5 letters. [2020-07-29 03:26:33,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 21 letters. Loop has 5 letters. [2020-07-29 03:26:33,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 17 letters. Loop has 5 letters. [2020-07-29 03:26:33,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 5 letters. [2020-07-29 03:26:33,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 17 letters. Loop has 5 letters. [2020-07-29 03:26:33,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 18 letters. Loop has 8 letters. [2020-07-29 03:26:33,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 8 letters. [2020-07-29 03:26:33,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 18 letters. Loop has 8 letters. [2020-07-29 03:26:33,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:33,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:33,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:33,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 03:26:33,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 03:26:33,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 15 letters. Loop has 6 letters. [2020-07-29 03:26:33,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:33,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:33,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:33,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:33,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:33,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:33,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:33,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:33,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:33,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:33,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:33,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:33,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:33,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:33,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:33,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:26:33,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:26:33,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:26:33,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:33,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:33,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:33,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:33,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:33,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:33,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:33,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:33,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:33,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 18 letters. Loop has 8 letters. [2020-07-29 03:26:33,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 8 letters. [2020-07-29 03:26:33,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 18 letters. Loop has 8 letters. [2020-07-29 03:26:33,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 19 letters. Loop has 8 letters. [2020-07-29 03:26:33,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 8 letters. [2020-07-29 03:26:33,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 19 letters. Loop has 8 letters. [2020-07-29 03:26:33,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:26:33,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:26:33,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:26:33,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 20 letters. Loop has 5 letters. [2020-07-29 03:26:33,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 5 letters. [2020-07-29 03:26:33,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 20 letters. Loop has 5 letters. [2020-07-29 03:26:33,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 21 letters. Loop has 8 letters. [2020-07-29 03:26:33,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 8 letters. [2020-07-29 03:26:33,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 21 letters. Loop has 8 letters. [2020-07-29 03:26:33,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 21 letters. Loop has 5 letters. [2020-07-29 03:26:33,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 5 letters. [2020-07-29 03:26:33,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 21 letters. Loop has 5 letters. [2020-07-29 03:26:33,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 14 letters. Loop has 8 letters. [2020-07-29 03:26:33,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 8 letters. [2020-07-29 03:26:33,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 14 letters. Loop has 8 letters. [2020-07-29 03:26:33,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 22 letters. Loop has 5 letters. [2020-07-29 03:26:33,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 5 letters. [2020-07-29 03:26:33,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 22 letters. Loop has 5 letters. [2020-07-29 03:26:33,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:33,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:33,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:33,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 23 letters. Loop has 12 letters. [2020-07-29 03:26:33,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 23 letters. Loop has 12 letters. [2020-07-29 03:26:33,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 23 letters. Loop has 12 letters. [2020-07-29 03:26:33,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 23 letters. Loop has 5 letters. [2020-07-29 03:26:33,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 23 letters. Loop has 5 letters. [2020-07-29 03:26:33,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 23 letters. Loop has 5 letters. [2020-07-29 03:26:33,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 24 letters. Loop has 5 letters. [2020-07-29 03:26:33,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 5 letters. [2020-07-29 03:26:33,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 24 letters. Loop has 5 letters. [2020-07-29 03:26:33,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:33,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:33,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:33,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:33,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:33,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:33,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:33,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:33,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:33,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:33,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:33,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:33,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:33,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:33,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:33,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:33,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:33,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:33,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:33,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:33,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 99 states and 145 transitions. cyclomatic complexity: 56 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:33,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,556 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:26:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2020-07-29 03:26:33,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:33,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:33,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 99 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:26:33,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 145 transitions. cyclomatic complexity: 56 [2020-07-29 03:26:33,578 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2020-07-29 03:26:33,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 32 states and 43 transitions. [2020-07-29 03:26:33,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-07-29 03:26:33,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-07-29 03:26:33,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 43 transitions. [2020-07-29 03:26:33,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:33,593 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-07-29 03:26:33,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 43 transitions. [2020-07-29 03:26:33,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-29 03:26:33,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:33,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states and 43 transitions. Second operand 32 states. [2020-07-29 03:26:33,623 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states and 43 transitions. Second operand 32 states. [2020-07-29 03:26:33,625 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand 32 states. [2020-07-29 03:26:33,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:33,630 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2020-07-29 03:26:33,630 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2020-07-29 03:26:33,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:33,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:33,632 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states and 43 transitions. [2020-07-29 03:26:33,632 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states and 43 transitions. [2020-07-29 03:26:33,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:33,634 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2020-07-29 03:26:33,634 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2020-07-29 03:26:33,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:33,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:33,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:33,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-29 03:26:33,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2020-07-29 03:26:33,638 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-07-29 03:26:33,638 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-07-29 03:26:33,638 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:26:33,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2020-07-29 03:26:33,639 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2020-07-29 03:26:33,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:33,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:33,639 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:33,639 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:33,640 INFO L794 eck$LassoCheckResult]: Stem: 247#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 229#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 222#L555 assume !(main_~length1~0 < 1); 223#L555-2 assume !(main_~length2~0 < 1); 240#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 241#L564-3 assume !(main_~i~0 < main_~length1~0); 251#L564-4 main_~i~1 := 0; 221#L568-3 [2020-07-29 03:26:33,640 INFO L796 eck$LassoCheckResult]: Loop: 221#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 220#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 221#L568-3 [2020-07-29 03:26:33,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:33,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2020-07-29 03:26:33,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:33,641 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588078418] [2020-07-29 03:26:33,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:33,715 INFO L280 TraceCheckUtils]: 0: Hoare triple {319#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {319#true} is VALID [2020-07-29 03:26:33,715 INFO L280 TraceCheckUtils]: 1: Hoare triple {319#true} havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; {319#true} is VALID [2020-07-29 03:26:33,716 INFO L280 TraceCheckUtils]: 2: Hoare triple {319#true} assume !(main_~length1~0 < 1); {321#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:26:33,717 INFO L280 TraceCheckUtils]: 3: Hoare triple {321#(<= 1 ULTIMATE.start_main_~length1~0)} assume !(main_~length2~0 < 1); {321#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:26:33,718 INFO L280 TraceCheckUtils]: 4: Hoare triple {321#(<= 1 ULTIMATE.start_main_~length1~0)} call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; {322#(and (<= 1 ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 03:26:33,719 INFO L280 TraceCheckUtils]: 5: Hoare triple {322#(and (<= 1 ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~i~0))} assume !(main_~i~0 < main_~length1~0); {320#false} is VALID [2020-07-29 03:26:33,719 INFO L280 TraceCheckUtils]: 6: Hoare triple {320#false} main_~i~1 := 0; {320#false} is VALID [2020-07-29 03:26:33,720 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 03:26:33,721 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588078418] [2020-07-29 03:26:33,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:33,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:26:33,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529046413] [2020-07-29 03:26:33,725 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:26:33,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:33,725 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2020-07-29 03:26:33,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:33,726 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598511859] [2020-07-29 03:26:33,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:33,734 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:33,739 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:33,741 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:33,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:33,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:26:33,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:26:33,781 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. cyclomatic complexity: 15 Second operand 4 states. [2020-07-29 03:26:33,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:33,893 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2020-07-29 03:26:33,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:26:33,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:26:33,904 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 03:26:33,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. [2020-07-29 03:26:33,906 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2020-07-29 03:26:33,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 43 transitions. [2020-07-29 03:26:33,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-07-29 03:26:33,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-07-29 03:26:33,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 43 transitions. [2020-07-29 03:26:33,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:33,909 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2020-07-29 03:26:33,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 43 transitions. [2020-07-29 03:26:33,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-07-29 03:26:33,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:33,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 43 transitions. Second operand 32 states. [2020-07-29 03:26:33,911 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 43 transitions. Second operand 32 states. [2020-07-29 03:26:33,912 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 32 states. [2020-07-29 03:26:33,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:33,913 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2020-07-29 03:26:33,913 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2020-07-29 03:26:33,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:33,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:33,914 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states and 43 transitions. [2020-07-29 03:26:33,914 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states and 43 transitions. [2020-07-29 03:26:33,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:33,916 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2020-07-29 03:26:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2020-07-29 03:26:33,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:33,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:33,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:33,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-29 03:26:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2020-07-29 03:26:33,918 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-07-29 03:26:33,918 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2020-07-29 03:26:33,918 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:26:33,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. [2020-07-29 03:26:33,919 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2020-07-29 03:26:33,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:33,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:33,919 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:33,920 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:33,920 INFO L794 eck$LassoCheckResult]: Stem: 385#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 367#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 360#L555 assume !(main_~length1~0 < 1); 361#L555-2 assume !(main_~length2~0 < 1); 376#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 377#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 387#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 388#L564-3 assume !(main_~i~0 < main_~length1~0); 389#L564-4 main_~i~1 := 0; 359#L568-3 [2020-07-29 03:26:33,920 INFO L796 eck$LassoCheckResult]: Loop: 359#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 358#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 359#L568-3 [2020-07-29 03:26:33,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:33,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1298440016, now seen corresponding path program 1 times [2020-07-29 03:26:33,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:33,921 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708538773] [2020-07-29 03:26:33,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:33,936 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:33,951 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:33,955 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:33,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:33,956 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 2 times [2020-07-29 03:26:33,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:33,956 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431404035] [2020-07-29 03:26:33,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:33,962 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:33,966 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:33,968 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:33,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:33,969 INFO L82 PathProgramCache]: Analyzing trace with hash -2034626574, now seen corresponding path program 1 times [2020-07-29 03:26:33,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:33,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414112773] [2020-07-29 03:26:33,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:33,996 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:34,030 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:34,041 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:34,311 WARN L193 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2020-07-29 03:26:34,448 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:34,448 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:34,448 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:34,449 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:34,449 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:34,449 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:34,449 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:34,449 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:34,449 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration3_Lasso [2020-07-29 03:26:34,449 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:34,449 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:34,478 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 03:26:34,482 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 03:26:34,486 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 03:26:34,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:34,493 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 03:26:34,498 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 03:26:34,705 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2020-07-29 03:26:34,734 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:26:34,735 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:26:34,739 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 03:26:34,743 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 03:26:34,746 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 03:26:34,750 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 03:26:34,753 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 03:26:34,757 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 03:26:34,760 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 03:26:34,764 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 03:26:35,491 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:35,491 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 03:26:35,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:35,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:35,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:35,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:35,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:35,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:35,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:35,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:35,503 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:35,541 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:35,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:35,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:35,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:35,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:35,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:35,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:35,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:35,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:35,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:35,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:35,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:35,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:35,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:35,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:35,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:35,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:35,587 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 03:26:35,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:35,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:35,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:35,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:35,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:35,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:35,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:35,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:35,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:35,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:35,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:35,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:35,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:35,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:35,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:35,649 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:35,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:35,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:35,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:35,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:35,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:35,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:35,724 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:35,724 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:35,728 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) [2020-07-29 03:26:35,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:35,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:35,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:35,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:35,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:35,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:35,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:35,810 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 03:26:35,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:35,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:35,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:35,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:35,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:35,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:35,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:35,865 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) [2020-07-29 03:26:35,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:35,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:35,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:35,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:35,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:35,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:35,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:35,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:35,906 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 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 03:26:35,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:35,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:35,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:35,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:35,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:35,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:35,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:35,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:35,947 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 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:35,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:35,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:35,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:35,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:35,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:35,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:35,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:35,996 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:36,040 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-07-29 03:26:36,040 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:36,042 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:36,045 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:36,045 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:36,045 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_2, ULTIMATE.start_main_~nondetString2~0.offset) = -1*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc23.base)_2 - 1*ULTIMATE.start_main_~nondetString2~0.offset Supporting invariants [] [2020-07-29 03:26:36,099 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2020-07-29 03:26:36,106 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27;" "main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26;" [2020-07-29 03:26:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:36,111 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:26:36,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:36,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:26:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:36,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:36,169 INFO L280 TraceCheckUtils]: 0: Hoare triple {465#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {465#unseeded} is VALID [2020-07-29 03:26:36,170 INFO L280 TraceCheckUtils]: 1: Hoare triple {465#unseeded} havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; {465#unseeded} is VALID [2020-07-29 03:26:36,171 INFO L280 TraceCheckUtils]: 2: Hoare triple {465#unseeded} assume !(main_~length1~0 < 1); {465#unseeded} is VALID [2020-07-29 03:26:36,171 INFO L280 TraceCheckUtils]: 3: Hoare triple {465#unseeded} assume !(main_~length2~0 < 1); {465#unseeded} is VALID [2020-07-29 03:26:36,172 INFO L280 TraceCheckUtils]: 4: Hoare triple {465#unseeded} call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; {524#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} is VALID [2020-07-29 03:26:36,173 INFO L280 TraceCheckUtils]: 5: Hoare triple {524#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; {524#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} is VALID [2020-07-29 03:26:36,174 INFO L280 TraceCheckUtils]: 6: Hoare triple {524#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; {524#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} is VALID [2020-07-29 03:26:36,175 INFO L280 TraceCheckUtils]: 7: Hoare triple {524#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} assume !(main_~i~0 < main_~length1~0); {524#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} is VALID [2020-07-29 03:26:36,175 INFO L280 TraceCheckUtils]: 8: Hoare triple {524#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} main_~i~1 := 0; {524#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc23.base|) unseeded)} is VALID [2020-07-29 03:26:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:36,181 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:26:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:36,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:36,218 INFO L280 TraceCheckUtils]: 0: Hoare triple {525#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc23.base|) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~1) (select |#length| |ULTIMATE.start_main_#t~malloc23.base|) (* (- 1) ULTIMATE.start_main_~nondetString2~0.offset))))} assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; {557#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc23.base|) (<= (+ ULTIMATE.start_main_~nondetString2~0.offset ULTIMATE.start_main_~i~1 1) (select |#length| ULTIMATE.start_main_~nondetString2~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc23.base|) (+ oldRank0 ULTIMATE.start_main_~nondetString2~0.offset ULTIMATE.start_main_~i~1)))} is VALID [2020-07-29 03:26:36,219 INFO L280 TraceCheckUtils]: 1: Hoare triple {557#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc23.base|) (<= (+ ULTIMATE.start_main_~nondetString2~0.offset ULTIMATE.start_main_~i~1 1) (select |#length| ULTIMATE.start_main_~nondetString2~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc23.base|) (+ oldRank0 ULTIMATE.start_main_~nondetString2~0.offset ULTIMATE.start_main_~i~1)))} main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; {527#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc23.base|) (or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~1) (select |#length| |ULTIMATE.start_main_#t~malloc23.base|) (* (- 1) ULTIMATE.start_main_~nondetString2~0.offset))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 03:26:36,220 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 03:26:36,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:26:36,234 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:36,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:36,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,235 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 03:26:36,235 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14 Second operand 4 states. [2020-07-29 03:26:36,482 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 42 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 55 states and 75 transitions. Complement of second has 7 states. [2020-07-29 03:26:36,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:36,482 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:36,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 42 transitions. cyclomatic complexity: 14 [2020-07-29 03:26:36,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:36,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:36,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:26:36,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:36,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:36,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:36,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 75 transitions. [2020-07-29 03:26:36,486 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-07-29 03:26:36,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:36,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:36,486 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 42 transitions. cyclomatic complexity: 14 [2020-07-29 03:26:36,490 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 19 examples of accepted words. [2020-07-29 03:26:36,490 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:26:36,491 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:36,492 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:36,492 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 55 states and 75 transitions. cyclomatic complexity: 26 [2020-07-29 03:26:36,495 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 17 examples of accepted words. [2020-07-29 03:26:36,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:36,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:36,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:36,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:36,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:36,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:36,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:36,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:36,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:36,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 55 letters. Loop has 55 letters. [2020-07-29 03:26:36,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 55 letters. Loop has 55 letters. [2020-07-29 03:26:36,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 55 letters. Loop has 55 letters. [2020-07-29 03:26:36,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 32 letters. Loop has 32 letters. [2020-07-29 03:26:36,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 32 letters. Loop has 32 letters. [2020-07-29 03:26:36,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 32 letters. Loop has 32 letters. [2020-07-29 03:26:36,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:36,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:36,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:36,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 16 letters. Loop has 8 letters. [2020-07-29 03:26:36,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 8 letters. [2020-07-29 03:26:36,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 16 letters. Loop has 8 letters. [2020-07-29 03:26:36,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:36,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:36,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:36,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:36,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:36,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:36,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 8 letters. [2020-07-29 03:26:36,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 22 letters. Loop has 8 letters. [2020-07-29 03:26:36,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 22 letters. Loop has 8 letters. [2020-07-29 03:26:36,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 8 letters. [2020-07-29 03:26:36,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 23 letters. Loop has 8 letters. [2020-07-29 03:26:36,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 23 letters. Loop has 8 letters. [2020-07-29 03:26:36,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:36,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:36,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:36,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 5 letters. [2020-07-29 03:26:36,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 24 letters. Loop has 5 letters. [2020-07-29 03:26:36,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 24 letters. Loop has 5 letters. [2020-07-29 03:26:36,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 25 letters. Loop has 12 letters. [2020-07-29 03:26:36,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 25 letters. Loop has 12 letters. [2020-07-29 03:26:36,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 25 letters. Loop has 12 letters. [2020-07-29 03:26:36,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 25 letters. Loop has 5 letters. [2020-07-29 03:26:36,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 25 letters. Loop has 5 letters. [2020-07-29 03:26:36,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 25 letters. Loop has 5 letters. [2020-07-29 03:26:36,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 5 letters. [2020-07-29 03:26:36,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 23 letters. Loop has 5 letters. [2020-07-29 03:26:36,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 23 letters. Loop has 5 letters. [2020-07-29 03:26:36,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 26 letters. Loop has 5 letters. [2020-07-29 03:26:36,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 26 letters. Loop has 5 letters. [2020-07-29 03:26:36,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 26 letters. Loop has 5 letters. [2020-07-29 03:26:36,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 8 letters. [2020-07-29 03:26:36,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 8 letters. [2020-07-29 03:26:36,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 21 letters. Loop has 8 letters. [2020-07-29 03:26:36,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 5 letters. [2020-07-29 03:26:36,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 22 letters. Loop has 5 letters. [2020-07-29 03:26:36,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 22 letters. Loop has 5 letters. [2020-07-29 03:26:36,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:26:36,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:26:36,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:26:36,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:36,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:36,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:36,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:36,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:36,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:36,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:36,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:36,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:36,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:26:36,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:26:36,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:26:36,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:36,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:36,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:36,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:36,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:36,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:36,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:26:36,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:26:36,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:26:36,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 8 letters. [2020-07-29 03:26:36,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 8 letters. [2020-07-29 03:26:36,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 21 letters. Loop has 8 letters. [2020-07-29 03:26:36,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 8 letters. [2020-07-29 03:26:36,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 22 letters. Loop has 8 letters. [2020-07-29 03:26:36,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 22 letters. Loop has 8 letters. [2020-07-29 03:26:36,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 5 letters. [2020-07-29 03:26:36,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 22 letters. Loop has 5 letters. [2020-07-29 03:26:36,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 22 letters. Loop has 5 letters. [2020-07-29 03:26:36,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 8 letters. [2020-07-29 03:26:36,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 23 letters. Loop has 8 letters. [2020-07-29 03:26:36,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 23 letters. Loop has 8 letters. [2020-07-29 03:26:36,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 5 letters. [2020-07-29 03:26:36,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 23 letters. Loop has 5 letters. [2020-07-29 03:26:36,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 23 letters. Loop has 5 letters. [2020-07-29 03:26:36,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 5 letters. [2020-07-29 03:26:36,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 24 letters. Loop has 5 letters. [2020-07-29 03:26:36,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 24 letters. Loop has 5 letters. [2020-07-29 03:26:36,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 25 letters. Loop has 12 letters. [2020-07-29 03:26:36,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 25 letters. Loop has 12 letters. [2020-07-29 03:26:36,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 25 letters. Loop has 12 letters. [2020-07-29 03:26:36,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 25 letters. Loop has 5 letters. [2020-07-29 03:26:36,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 25 letters. Loop has 5 letters. [2020-07-29 03:26:36,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 25 letters. Loop has 5 letters. [2020-07-29 03:26:36,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 26 letters. Loop has 5 letters. [2020-07-29 03:26:36,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 26 letters. Loop has 5 letters. [2020-07-29 03:26:36,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 26 letters. Loop has 5 letters. [2020-07-29 03:26:36,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 16 letters. Loop has 8 letters. [2020-07-29 03:26:36,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 8 letters. [2020-07-29 03:26:36,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 16 letters. Loop has 8 letters. [2020-07-29 03:26:36,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:36,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:36,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 17 letters. Loop has 3 letters. [2020-07-29 03:26:36,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:36,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:36,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:36,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:36,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:36,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:36,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:36,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:36,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:36,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:36,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:36,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:36,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 42 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:36,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:36,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 55 states and 75 transitions. cyclomatic complexity: 26 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:36,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,549 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:36,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:26:36,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2020-07-29 03:26:36,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:36,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:26:36,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:36,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:36,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 75 transitions. cyclomatic complexity: 26 [2020-07-29 03:26:36,554 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-07-29 03:26:36,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 33 states and 44 transitions. [2020-07-29 03:26:36,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-07-29 03:26:36,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-07-29 03:26:36,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2020-07-29 03:26:36,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:36,557 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-07-29 03:26:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2020-07-29 03:26:36,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-29 03:26:36,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:36,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 44 transitions. Second operand 33 states. [2020-07-29 03:26:36,560 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 44 transitions. Second operand 33 states. [2020-07-29 03:26:36,560 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 33 states. [2020-07-29 03:26:36,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:36,562 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2020-07-29 03:26:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2020-07-29 03:26:36,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:36,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:36,563 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states and 44 transitions. [2020-07-29 03:26:36,563 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states and 44 transitions. [2020-07-29 03:26:36,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:36,565 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2020-07-29 03:26:36,565 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2020-07-29 03:26:36,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:36,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:36,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:36,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:36,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-29 03:26:36,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2020-07-29 03:26:36,568 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-07-29 03:26:36,568 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-07-29 03:26:36,568 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:26:36,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 44 transitions. [2020-07-29 03:26:36,569 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-07-29 03:26:36,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:36,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:36,569 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:36,569 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:36,570 INFO L794 eck$LassoCheckResult]: Stem: 656#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 638#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 630#L555 assume !(main_~length1~0 < 1); 631#L555-2 assume !(main_~length2~0 < 1); 649#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 650#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 658#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 659#L564-3 assume !(main_~i~0 < main_~length1~0); 660#L564-4 main_~i~1 := 0; 634#L568-3 assume !(main_~i~1 < main_~length2~0); 635#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 655#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 646#L518-4 [2020-07-29 03:26:36,570 INFO L796 eck$LassoCheckResult]: Loop: 646#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 651#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 645#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 646#L518-4 [2020-07-29 03:26:36,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:36,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1351083894, now seen corresponding path program 1 times [2020-07-29 03:26:36,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:36,571 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942704462] [2020-07-29 03:26:36,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:36,621 INFO L280 TraceCheckUtils]: 0: Hoare triple {730#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {730#true} is VALID [2020-07-29 03:26:36,622 INFO L280 TraceCheckUtils]: 1: Hoare triple {730#true} havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; {730#true} is VALID [2020-07-29 03:26:36,622 INFO L280 TraceCheckUtils]: 2: Hoare triple {730#true} assume !(main_~length1~0 < 1); {730#true} is VALID [2020-07-29 03:26:36,623 INFO L280 TraceCheckUtils]: 3: Hoare triple {730#true} assume !(main_~length2~0 < 1); {732#(<= 1 ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:26:36,624 INFO L280 TraceCheckUtils]: 4: Hoare triple {732#(<= 1 ULTIMATE.start_main_~length2~0)} call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; {732#(<= 1 ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:26:36,624 INFO L280 TraceCheckUtils]: 5: Hoare triple {732#(<= 1 ULTIMATE.start_main_~length2~0)} assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; {732#(<= 1 ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:26:36,625 INFO L280 TraceCheckUtils]: 6: Hoare triple {732#(<= 1 ULTIMATE.start_main_~length2~0)} main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; {732#(<= 1 ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:26:36,625 INFO L280 TraceCheckUtils]: 7: Hoare triple {732#(<= 1 ULTIMATE.start_main_~length2~0)} assume !(main_~i~0 < main_~length1~0); {732#(<= 1 ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:26:36,626 INFO L280 TraceCheckUtils]: 8: Hoare triple {732#(<= 1 ULTIMATE.start_main_~length2~0)} main_~i~1 := 0; {733#(and (<= 1 ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~i~1))} is VALID [2020-07-29 03:26:36,627 INFO L280 TraceCheckUtils]: 9: Hoare triple {733#(and (<= 1 ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~i~1))} assume !(main_~i~1 < main_~length2~0); {731#false} is VALID [2020-07-29 03:26:36,627 INFO L280 TraceCheckUtils]: 10: Hoare triple {731#false} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; {731#false} is VALID [2020-07-29 03:26:36,627 INFO L280 TraceCheckUtils]: 11: Hoare triple {731#false} assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; {731#false} is VALID [2020-07-29 03:26:36,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:26:36,628 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942704462] [2020-07-29 03:26:36,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:36,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:26:36,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627527938] [2020-07-29 03:26:36,629 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:26:36,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:36,629 INFO L82 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 1 times [2020-07-29 03:26:36,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:36,629 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062687440] [2020-07-29 03:26:36,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:36,634 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:36,637 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:36,639 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:36,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:36,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:26:36,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:26:36,677 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. cyclomatic complexity: 15 Second operand 4 states. [2020-07-29 03:26:36,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:36,796 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2020-07-29 03:26:36,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:26:36,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:26:36,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:36,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2020-07-29 03:26:36,827 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-07-29 03:26:36,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 44 transitions. [2020-07-29 03:26:36,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-07-29 03:26:36,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-07-29 03:26:36,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2020-07-29 03:26:36,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:36,829 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-07-29 03:26:36,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2020-07-29 03:26:36,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-07-29 03:26:36,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:36,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 44 transitions. Second operand 33 states. [2020-07-29 03:26:36,832 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 44 transitions. Second operand 33 states. [2020-07-29 03:26:36,833 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand 33 states. [2020-07-29 03:26:36,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:36,834 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2020-07-29 03:26:36,835 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2020-07-29 03:26:36,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:36,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:36,836 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states and 44 transitions. [2020-07-29 03:26:36,836 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states and 44 transitions. [2020-07-29 03:26:36,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:36,838 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2020-07-29 03:26:36,838 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2020-07-29 03:26:36,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:36,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:36,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:36,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-29 03:26:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2020-07-29 03:26:36,841 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2020-07-29 03:26:36,841 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2020-07-29 03:26:36,841 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:26:36,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2020-07-29 03:26:36,841 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-07-29 03:26:36,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:36,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:36,842 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:36,842 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:36,843 INFO L794 eck$LassoCheckResult]: Stem: 798#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 780#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 772#L555 assume !(main_~length1~0 < 1); 773#L555-2 assume !(main_~length2~0 < 1); 790#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 791#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 800#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 801#L564-3 assume !(main_~i~0 < main_~length1~0); 802#L564-4 main_~i~1 := 0; 776#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 770#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 771#L568-3 assume !(main_~i~1 < main_~length2~0); 777#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 797#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 788#L518-4 [2020-07-29 03:26:36,843 INFO L796 eck$LassoCheckResult]: Loop: 788#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 793#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 787#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 788#L518-4 [2020-07-29 03:26:36,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:36,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1313217428, now seen corresponding path program 1 times [2020-07-29 03:26:36,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:36,844 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183978801] [2020-07-29 03:26:36,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:37,226 INFO L280 TraceCheckUtils]: 0: Hoare triple {874#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {874#true} is VALID [2020-07-29 03:26:37,227 INFO L280 TraceCheckUtils]: 1: Hoare triple {874#true} havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; {874#true} is VALID [2020-07-29 03:26:37,227 INFO L280 TraceCheckUtils]: 2: Hoare triple {874#true} assume !(main_~length1~0 < 1); {874#true} is VALID [2020-07-29 03:26:37,228 INFO L280 TraceCheckUtils]: 3: Hoare triple {874#true} assume !(main_~length2~0 < 1); {876#(<= 1 ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:26:37,229 INFO L280 TraceCheckUtils]: 4: Hoare triple {876#(<= 1 ULTIMATE.start_main_~length2~0)} call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; {877#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:37,233 INFO L280 TraceCheckUtils]: 5: Hoare triple {877#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; {877#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:37,234 INFO L280 TraceCheckUtils]: 6: Hoare triple {877#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; {877#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:37,235 INFO L280 TraceCheckUtils]: 7: Hoare triple {877#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~0 < main_~length1~0); {877#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:37,236 INFO L280 TraceCheckUtils]: 8: Hoare triple {877#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_~i~1 := 0; {878#(and (or (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (and (= 0 ULTIMATE.start_main_~i~1) (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:37,237 INFO L280 TraceCheckUtils]: 9: Hoare triple {878#(and (or (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (and (= 0 ULTIMATE.start_main_~i~1) (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; {878#(and (or (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (and (= 0 ULTIMATE.start_main_~i~1) (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:37,238 INFO L280 TraceCheckUtils]: 10: Hoare triple {878#(and (or (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (and (= 0 ULTIMATE.start_main_~i~1) (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; {879#(and (or (and (<= ULTIMATE.start_main_~i~1 1) (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset))) (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset))) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:37,238 INFO L280 TraceCheckUtils]: 11: Hoare triple {879#(and (or (and (<= ULTIMATE.start_main_~i~1 1) (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset))) (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset))) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~1 < main_~length2~0); {880#(and (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:37,240 INFO L280 TraceCheckUtils]: 12: Hoare triple {880#(and (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; {881#(= 0 ULTIMATE.start_cstrstr_~c~0)} is VALID [2020-07-29 03:26:37,240 INFO L280 TraceCheckUtils]: 13: Hoare triple {881#(= 0 ULTIMATE.start_cstrstr_~c~0)} assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; {875#false} is VALID [2020-07-29 03:26:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:26:37,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183978801] [2020-07-29 03:26:37,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751772103] [2020-07-29 03:26:37,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:26:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:37,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-29 03:26:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:37,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:37,992 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2020-07-29 03:26:38,009 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:38,010 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2020-07-29 03:26:38,011 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 03:26:38,017 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-29 03:26:38,017 INFO L440 ElimStorePlain]: Different costs {0=[v_arrayElimCell_2], 1=[v_arrayElimCell_1]} [2020-07-29 03:26:38,158 INFO L280 TraceCheckUtils]: 0: Hoare triple {874#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {874#true} is VALID [2020-07-29 03:26:38,158 INFO L280 TraceCheckUtils]: 1: Hoare triple {874#true} havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; {874#true} is VALID [2020-07-29 03:26:38,158 INFO L280 TraceCheckUtils]: 2: Hoare triple {874#true} assume !(main_~length1~0 < 1); {874#true} is VALID [2020-07-29 03:26:38,161 INFO L280 TraceCheckUtils]: 3: Hoare triple {874#true} assume !(main_~length2~0 < 1); {876#(<= 1 ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:26:38,162 INFO L280 TraceCheckUtils]: 4: Hoare triple {876#(<= 1 ULTIMATE.start_main_~length2~0)} call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; {897#(and (<= 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} is VALID [2020-07-29 03:26:38,163 INFO L280 TraceCheckUtils]: 5: Hoare triple {897#(and (<= 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; {897#(and (<= 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} is VALID [2020-07-29 03:26:38,164 INFO L280 TraceCheckUtils]: 6: Hoare triple {897#(and (<= 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; {897#(and (<= 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} is VALID [2020-07-29 03:26:38,164 INFO L280 TraceCheckUtils]: 7: Hoare triple {897#(and (<= 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} assume !(main_~i~0 < main_~length1~0); {897#(and (<= 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} is VALID [2020-07-29 03:26:38,165 INFO L280 TraceCheckUtils]: 8: Hoare triple {897#(and (<= 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} main_~i~1 := 0; {910#(and (<= ULTIMATE.start_main_~i~1 0) (<= 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} is VALID [2020-07-29 03:26:38,166 INFO L280 TraceCheckUtils]: 9: Hoare triple {910#(and (<= ULTIMATE.start_main_~i~1 0) (<= 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; {910#(and (<= ULTIMATE.start_main_~i~1 0) (<= 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} is VALID [2020-07-29 03:26:38,168 INFO L280 TraceCheckUtils]: 10: Hoare triple {910#(and (<= ULTIMATE.start_main_~i~1 0) (<= 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; {917#(and (<= 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~i~1 1) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} is VALID [2020-07-29 03:26:38,169 INFO L280 TraceCheckUtils]: 11: Hoare triple {917#(and (<= 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~i~1 1) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} assume !(main_~i~1 < main_~length2~0); {921#(and (<= 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (<= ULTIMATE.start_main_~length2~0 1))} is VALID [2020-07-29 03:26:38,172 INFO L280 TraceCheckUtils]: 12: Hoare triple {921#(and (<= 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (<= ULTIMATE.start_main_~length2~0 1))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; {881#(= 0 ULTIMATE.start_cstrstr_~c~0)} is VALID [2020-07-29 03:26:38,172 INFO L280 TraceCheckUtils]: 13: Hoare triple {881#(= 0 ULTIMATE.start_cstrstr_~c~0)} assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; {875#false} is VALID [2020-07-29 03:26:38,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:26:38,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:26:38,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-07-29 03:26:38,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447608045] [2020-07-29 03:26:38,175 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:26:38,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:38,176 INFO L82 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 2 times [2020-07-29 03:26:38,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:38,176 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875174446] [2020-07-29 03:26:38,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:38,181 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:38,183 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:38,185 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:38,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:38,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-29 03:26:38,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-07-29 03:26:38,227 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 12 states. [2020-07-29 03:26:38,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:38,877 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2020-07-29 03:26:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 03:26:38,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-29 03:26:38,917 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:38,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2020-07-29 03:26:38,920 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-07-29 03:26:38,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 36 states and 46 transitions. [2020-07-29 03:26:38,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-07-29 03:26:38,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-07-29 03:26:38,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2020-07-29 03:26:38,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:38,923 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2020-07-29 03:26:38,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2020-07-29 03:26:38,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2020-07-29 03:26:38,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:38,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states and 46 transitions. Second operand 35 states. [2020-07-29 03:26:38,926 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states and 46 transitions. Second operand 35 states. [2020-07-29 03:26:38,926 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand 35 states. [2020-07-29 03:26:38,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:38,932 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2020-07-29 03:26:38,932 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2020-07-29 03:26:38,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:38,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:38,933 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states and 46 transitions. [2020-07-29 03:26:38,933 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states and 46 transitions. [2020-07-29 03:26:38,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:38,935 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2020-07-29 03:26:38,935 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2020-07-29 03:26:38,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:38,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:38,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:38,936 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:38,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-29 03:26:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2020-07-29 03:26:38,937 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-07-29 03:26:38,938 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-07-29 03:26:38,938 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:26:38,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2020-07-29 03:26:38,938 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-07-29 03:26:38,938 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:38,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:38,939 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:38,939 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:38,939 INFO L794 eck$LassoCheckResult]: Stem: 1002#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 983#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 975#L555 assume !(main_~length1~0 < 1); 976#L555-2 assume !(main_~length2~0 < 1); 994#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 995#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 1004#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 1005#L564-3 assume !(main_~i~0 < main_~length1~0); 1006#L564-4 main_~i~1 := 0; 981#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 973#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 974#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 982#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 1007#L568-3 assume !(main_~i~1 < main_~length2~0); 1000#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 1001#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 991#L518-4 [2020-07-29 03:26:38,940 INFO L796 eck$LassoCheckResult]: Loop: 991#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 996#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 990#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 991#L518-4 [2020-07-29 03:26:38,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:38,940 INFO L82 PathProgramCache]: Analyzing trace with hash -716718030, now seen corresponding path program 2 times [2020-07-29 03:26:38,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:38,942 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771319168] [2020-07-29 03:26:38,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:38,969 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:38,986 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:38,993 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:38,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:38,993 INFO L82 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 3 times [2020-07-29 03:26:38,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:38,994 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113522648] [2020-07-29 03:26:38,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:38,997 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:38,999 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,001 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:39,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:39,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1464353502, now seen corresponding path program 1 times [2020-07-29 03:26:39,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:39,002 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478545778] [2020-07-29 03:26:39,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:39,514 INFO L280 TraceCheckUtils]: 0: Hoare triple {1087#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1087#true} is VALID [2020-07-29 03:26:39,515 INFO L280 TraceCheckUtils]: 1: Hoare triple {1087#true} havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; {1087#true} is VALID [2020-07-29 03:26:39,516 INFO L280 TraceCheckUtils]: 2: Hoare triple {1087#true} assume !(main_~length1~0 < 1); {1089#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:26:39,516 INFO L280 TraceCheckUtils]: 3: Hoare triple {1089#(<= 1 ULTIMATE.start_main_~length1~0)} assume !(main_~length2~0 < 1); {1089#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:26:39,517 INFO L280 TraceCheckUtils]: 4: Hoare triple {1089#(<= 1 ULTIMATE.start_main_~length1~0)} call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; {1090#(and (<= 1 ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:39,518 INFO L280 TraceCheckUtils]: 5: Hoare triple {1090#(and (<= 1 ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; {1090#(and (<= 1 ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:39,518 INFO L280 TraceCheckUtils]: 6: Hoare triple {1090#(and (<= 1 ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; {1091#(and (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~0 1) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:39,524 INFO L280 TraceCheckUtils]: 7: Hoare triple {1091#(and (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~0 1) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~0 < main_~length1~0); {1092#(and (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 1) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:39,525 INFO L280 TraceCheckUtils]: 8: Hoare triple {1092#(and (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 1) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_~i~1 := 0; {1093#(and (<= 1 ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~i~1) (<= ULTIMATE.start_main_~length1~0 1) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:39,526 INFO L280 TraceCheckUtils]: 9: Hoare triple {1093#(and (<= 1 ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~i~1) (<= ULTIMATE.start_main_~length1~0 1) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; {1093#(and (<= 1 ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~i~1) (<= ULTIMATE.start_main_~length1~0 1) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:39,527 INFO L280 TraceCheckUtils]: 10: Hoare triple {1093#(and (<= 1 ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~i~1) (<= ULTIMATE.start_main_~length1~0 1) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; {1094#(and (= ULTIMATE.start_main_~length1~0 (+ ULTIMATE.start_main_~nondetString2~0.offset ULTIMATE.start_main_~i~1)) (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 1) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:39,529 INFO L280 TraceCheckUtils]: 11: Hoare triple {1094#(and (= ULTIMATE.start_main_~length1~0 (+ ULTIMATE.start_main_~nondetString2~0.offset ULTIMATE.start_main_~i~1)) (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 1) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; {1095#(and (or (and (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 1)) (not (= (+ ULTIMATE.start_main_~length1~0 1) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (or (and (= ULTIMATE.start_main_~length1~0 (+ ULTIMATE.start_main_~nondetString2~0.offset ULTIMATE.start_main_~i~1)) (< (+ ULTIMATE.start_main_~i~1 1) ULTIMATE.start_main_~length2~0)) (= (+ ULTIMATE.start_main_~length1~0 1) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset))) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:39,530 INFO L280 TraceCheckUtils]: 12: Hoare triple {1095#(and (or (and (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 1)) (not (= (+ ULTIMATE.start_main_~length1~0 1) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (or (and (= ULTIMATE.start_main_~length1~0 (+ ULTIMATE.start_main_~nondetString2~0.offset ULTIMATE.start_main_~i~1)) (< (+ ULTIMATE.start_main_~i~1 1) ULTIMATE.start_main_~length2~0)) (= (+ ULTIMATE.start_main_~length1~0 1) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset))) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; {1096#(and (or (<= (+ ULTIMATE.start_main_~i~1 1) ULTIMATE.start_main_~length2~0) (= (+ ULTIMATE.start_main_~length1~0 1) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset))) (or (and (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 1)) (not (= (+ ULTIMATE.start_main_~length1~0 1) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:39,531 INFO L280 TraceCheckUtils]: 13: Hoare triple {1096#(and (or (<= (+ ULTIMATE.start_main_~i~1 1) ULTIMATE.start_main_~length2~0) (= (+ ULTIMATE.start_main_~length1~0 1) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset))) (or (and (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 1)) (not (= (+ ULTIMATE.start_main_~length1~0 1) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~1 < main_~length2~0); {1097#(and (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 1) (= (+ ULTIMATE.start_main_~length1~0 1) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:39,533 INFO L280 TraceCheckUtils]: 14: Hoare triple {1097#(and (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 1) (= (+ ULTIMATE.start_main_~length1~0 1) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; {1098#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrstr_~find.base) ULTIMATE.start_cstrstr_~find.offset))} is VALID [2020-07-29 03:26:39,533 INFO L280 TraceCheckUtils]: 15: Hoare triple {1098#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrstr_~find.base) ULTIMATE.start_cstrstr_~find.offset))} assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; {1099#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrlen_~s~0.base) ULTIMATE.start_cstrlen_~s~0.offset))} is VALID [2020-07-29 03:26:39,535 INFO L280 TraceCheckUtils]: 16: Hoare triple {1099#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrlen_~s~0.base) ULTIMATE.start_cstrlen_~s~0.offset))} call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); {1100#(= 0 |ULTIMATE.start_cstrlen_#t~mem3|)} is VALID [2020-07-29 03:26:39,536 INFO L280 TraceCheckUtils]: 17: Hoare triple {1100#(= 0 |ULTIMATE.start_cstrlen_#t~mem3|)} assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; {1088#false} is VALID [2020-07-29 03:26:39,536 INFO L280 TraceCheckUtils]: 18: Hoare triple {1088#false} cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; {1088#false} is VALID [2020-07-29 03:26:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:39,538 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478545778] [2020-07-29 03:26:39,538 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37152806] [2020-07-29 03:26:39,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:26:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:39,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 38 conjunts are in the unsatisfiable core [2020-07-29 03:26:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:39,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:40,086 INFO L350 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2020-07-29 03:26:40,087 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 21 [2020-07-29 03:26:40,088 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:26:40,110 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:40,137 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-07-29 03:26:40,138 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:54, output treesize:38 [2020-07-29 03:26:40,147 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:26:40,148 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_53|, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_~nondetString2~0.offset]. (and (<= 1 ULTIMATE.start_cstrstr_~find.offset) (< 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_cstrstr_~find.offset (+ ULTIMATE.start_main_~nondetString2~0.offset 1)) (<= ULTIMATE.start_main_~length2~0 2) (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (= |#memory_int| (let ((.cse0 (store |v_#memory_int_53| ULTIMATE.start_main_~nondetString1~0.base (store (select |v_#memory_int_53| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1)) 0)))) (store .cse0 ULTIMATE.start_cstrstr_~find.base (store (select .cse0 ULTIMATE.start_cstrstr_~find.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0))))) [2020-07-29 03:26:40,148 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length1~0]. (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrstr_~find.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= 1 ULTIMATE.start_cstrstr_~find.offset) (< 1 ULTIMATE.start_main_~length2~0) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1)))) (<= ULTIMATE.start_cstrstr_~find.offset (+ ULTIMATE.start_main_~nondetString2~0.offset 1)) (<= ULTIMATE.start_main_~length2~0 2) (<= ULTIMATE.start_main_~nondetString2~0.offset 0)) [2020-07-29 03:26:40,617 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-29 03:26:40,620 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:40,620 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 10 [2020-07-29 03:26:40,621 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:26:40,633 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:40,669 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:26:40,670 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:35, output treesize:3 [2020-07-29 03:26:40,673 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:26:40,673 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, ULTIMATE.start_cstrlen_~s~0.base, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_cstrlen_~s~0.offset]. (let ((.cse0 (select |#memory_int| ULTIMATE.start_cstrlen_~s~0.base))) (and (< 1 ULTIMATE.start_main_~length2~0) (<= 1 ULTIMATE.start_cstrlen_~s~0.offset) (= 0 (select .cse0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= ULTIMATE.start_cstrlen_~s~0.offset (+ ULTIMATE.start_main_~nondetString2~0.offset 1)) (<= ULTIMATE.start_main_~length2~0 2) (= (select .cse0 ULTIMATE.start_cstrlen_~s~0.offset) |ULTIMATE.start_cstrlen_#t~mem3|) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) [2020-07-29 03:26:40,673 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 |ULTIMATE.start_cstrlen_#t~mem3|) [2020-07-29 03:26:40,674 INFO L280 TraceCheckUtils]: 0: Hoare triple {1087#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1087#true} is VALID [2020-07-29 03:26:40,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {1087#true} havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; {1087#true} is VALID [2020-07-29 03:26:40,675 INFO L280 TraceCheckUtils]: 2: Hoare triple {1087#true} assume !(main_~length1~0 < 1); {1087#true} is VALID [2020-07-29 03:26:40,675 INFO L280 TraceCheckUtils]: 3: Hoare triple {1087#true} assume !(main_~length2~0 < 1); {1087#true} is VALID [2020-07-29 03:26:40,677 INFO L280 TraceCheckUtils]: 4: Hoare triple {1087#true} call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; {1116#(<= ULTIMATE.start_main_~nondetString2~0.offset 0)} is VALID [2020-07-29 03:26:40,677 INFO L280 TraceCheckUtils]: 5: Hoare triple {1116#(<= ULTIMATE.start_main_~nondetString2~0.offset 0)} assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; {1116#(<= ULTIMATE.start_main_~nondetString2~0.offset 0)} is VALID [2020-07-29 03:26:40,678 INFO L280 TraceCheckUtils]: 6: Hoare triple {1116#(<= ULTIMATE.start_main_~nondetString2~0.offset 0)} main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; {1116#(<= ULTIMATE.start_main_~nondetString2~0.offset 0)} is VALID [2020-07-29 03:26:40,678 INFO L280 TraceCheckUtils]: 7: Hoare triple {1116#(<= ULTIMATE.start_main_~nondetString2~0.offset 0)} assume !(main_~i~0 < main_~length1~0); {1116#(<= ULTIMATE.start_main_~nondetString2~0.offset 0)} is VALID [2020-07-29 03:26:40,679 INFO L280 TraceCheckUtils]: 8: Hoare triple {1116#(<= ULTIMATE.start_main_~nondetString2~0.offset 0)} main_~i~1 := 0; {1129#(and (= 0 ULTIMATE.start_main_~i~1) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} is VALID [2020-07-29 03:26:40,679 INFO L280 TraceCheckUtils]: 9: Hoare triple {1129#(and (= 0 ULTIMATE.start_main_~i~1) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; {1129#(and (= 0 ULTIMATE.start_main_~i~1) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} is VALID [2020-07-29 03:26:40,680 INFO L280 TraceCheckUtils]: 10: Hoare triple {1129#(and (= 0 ULTIMATE.start_main_~i~1) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; {1136#(and (= 1 ULTIMATE.start_main_~i~1) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} is VALID [2020-07-29 03:26:40,680 INFO L280 TraceCheckUtils]: 11: Hoare triple {1136#(and (= 1 ULTIMATE.start_main_~i~1) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; {1140#(and (< ULTIMATE.start_main_~i~1 ULTIMATE.start_main_~length2~0) (= 1 ULTIMATE.start_main_~i~1) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} is VALID [2020-07-29 03:26:40,681 INFO L280 TraceCheckUtils]: 12: Hoare triple {1140#(and (< ULTIMATE.start_main_~i~1 ULTIMATE.start_main_~length2~0) (= 1 ULTIMATE.start_main_~i~1) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; {1144#(and (< 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~i~1 2) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} is VALID [2020-07-29 03:26:40,682 INFO L280 TraceCheckUtils]: 13: Hoare triple {1144#(and (< 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~i~1 2) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} assume !(main_~i~1 < main_~length2~0); {1148#(and (< 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~length2~0 2) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} is VALID [2020-07-29 03:26:40,685 INFO L280 TraceCheckUtils]: 14: Hoare triple {1148#(and (< 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~length2~0 2) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; {1152#(and (<= 1 ULTIMATE.start_cstrstr_~find.offset) (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrstr_~find.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (< 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_cstrstr_~find.offset (+ ULTIMATE.start_main_~nondetString2~0.offset 1)) (<= ULTIMATE.start_main_~length2~0 2) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))))} is VALID [2020-07-29 03:26:40,687 INFO L280 TraceCheckUtils]: 15: Hoare triple {1152#(and (<= 1 ULTIMATE.start_cstrstr_~find.offset) (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrstr_~find.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (< 1 ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_cstrstr_~find.offset (+ ULTIMATE.start_main_~nondetString2~0.offset 1)) (<= ULTIMATE.start_main_~length2~0 2) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))))} assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; {1156#(and (<= 1 ULTIMATE.start_cstrlen_~s~0.offset) (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (< 1 ULTIMATE.start_main_~length2~0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrlen_~s~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= ULTIMATE.start_cstrlen_~s~0.offset (+ ULTIMATE.start_main_~nondetString2~0.offset 1)) (<= ULTIMATE.start_main_~length2~0 2) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))))} is VALID [2020-07-29 03:26:40,694 INFO L280 TraceCheckUtils]: 16: Hoare triple {1156#(and (<= 1 ULTIMATE.start_cstrlen_~s~0.offset) (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (< 1 ULTIMATE.start_main_~length2~0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrlen_~s~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= ULTIMATE.start_cstrlen_~s~0.offset (+ ULTIMATE.start_main_~nondetString2~0.offset 1)) (<= ULTIMATE.start_main_~length2~0 2) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))))} call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); {1100#(= 0 |ULTIMATE.start_cstrlen_#t~mem3|)} is VALID [2020-07-29 03:26:40,695 INFO L280 TraceCheckUtils]: 17: Hoare triple {1100#(= 0 |ULTIMATE.start_cstrlen_#t~mem3|)} assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; {1088#false} is VALID [2020-07-29 03:26:40,695 INFO L280 TraceCheckUtils]: 18: Hoare triple {1088#false} cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; {1088#false} is VALID [2020-07-29 03:26:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:26:40,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:26:40,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2020-07-29 03:26:40,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546715904] [2020-07-29 03:26:40,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:40,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-29 03:26:40,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2020-07-29 03:26:40,740 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 14 Second operand 22 states. [2020-07-29 03:26:44,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:44,154 INFO L93 Difference]: Finished difference Result 111 states and 141 transitions. [2020-07-29 03:26:44,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-29 03:26:44,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2020-07-29 03:26:44,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:44,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 141 transitions. [2020-07-29 03:26:44,226 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 62 [2020-07-29 03:26:44,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 111 states and 141 transitions. [2020-07-29 03:26:44,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2020-07-29 03:26:44,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2020-07-29 03:26:44,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 141 transitions. [2020-07-29 03:26:44,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:44,231 INFO L688 BuchiCegarLoop]: Abstraction has 111 states and 141 transitions. [2020-07-29 03:26:44,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 141 transitions. [2020-07-29 03:26:44,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 41. [2020-07-29 03:26:44,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:44,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states and 141 transitions. Second operand 41 states. [2020-07-29 03:26:44,235 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states and 141 transitions. Second operand 41 states. [2020-07-29 03:26:44,235 INFO L87 Difference]: Start difference. First operand 111 states and 141 transitions. Second operand 41 states. [2020-07-29 03:26:44,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:44,239 INFO L93 Difference]: Finished difference Result 111 states and 141 transitions. [2020-07-29 03:26:44,239 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 141 transitions. [2020-07-29 03:26:44,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:44,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:44,240 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 111 states and 141 transitions. [2020-07-29 03:26:44,240 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 111 states and 141 transitions. [2020-07-29 03:26:44,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:44,244 INFO L93 Difference]: Finished difference Result 111 states and 141 transitions. [2020-07-29 03:26:44,244 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 141 transitions. [2020-07-29 03:26:44,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:44,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:44,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:44,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:44,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-29 03:26:44,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2020-07-29 03:26:44,246 INFO L711 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2020-07-29 03:26:44,246 INFO L591 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2020-07-29 03:26:44,247 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 03:26:44,247 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 52 transitions. [2020-07-29 03:26:44,247 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-07-29 03:26:44,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:44,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:44,248 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:44,248 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:44,248 INFO L794 eck$LassoCheckResult]: Stem: 1344#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1324#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 1316#L555 assume !(main_~length1~0 < 1); 1317#L555-2 assume !(main_~length2~0 < 1); 1335#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 1336#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 1346#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 1347#L564-3 assume !(main_~i~0 < main_~length1~0); 1348#L564-4 main_~i~1 := 0; 1322#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 1314#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 1315#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 1323#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 1354#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 1353#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 1352#L568-3 assume !(main_~i~1 < main_~length2~0); 1351#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 1350#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 1332#L518-4 [2020-07-29 03:26:44,248 INFO L796 eck$LassoCheckResult]: Loop: 1332#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1349#L518-1 assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1331#L518-3 cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; 1332#L518-4 [2020-07-29 03:26:44,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:44,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1569540784, now seen corresponding path program 3 times [2020-07-29 03:26:44,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:44,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466511089] [2020-07-29 03:26:44,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:44,267 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:44,282 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:44,288 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:44,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:44,288 INFO L82 PathProgramCache]: Analyzing trace with hash 79603, now seen corresponding path program 4 times [2020-07-29 03:26:44,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:44,289 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154568531] [2020-07-29 03:26:44,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:44,292 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:44,294 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:44,295 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:44,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:44,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1119505220, now seen corresponding path program 2 times [2020-07-29 03:26:44,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:44,296 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687103317] [2020-07-29 03:26:44,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:44,313 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:44,333 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:44,339 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:46,187 WARN L193 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 190 DAG size of output: 156 [2020-07-29 03:26:46,655 WARN L193 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-07-29 03:26:46,659 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:46,659 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:46,659 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:46,660 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:46,660 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:46,660 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:46,660 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:46,660 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:46,660 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrstr-alloca-2.i_Iteration7_Lasso [2020-07-29 03:26:46,660 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:46,661 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:46,692 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 03:26:46,695 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 03:26:46,699 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 03:26:46,703 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 03:26:46,708 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 03:26:46,718 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 03:26:46,722 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 03:26:46,727 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 03:26:46,739 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 03:26:46,742 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 03:26:46,745 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 03:26:46,748 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 03:26:46,753 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 03:26:46,756 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 03:26:46,759 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 03:26:46,763 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 03:26:46,766 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 03:26:46,771 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 03:26:46,775 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 03:26:46,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 03:26:46,785 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 03:26:46,790 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 03:26:46,795 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 03:26:47,424 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2020-07-29 03:26:47,551 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2020-07-29 03:26:47,552 WARN L257 bleTransFormulaUtils]: 4 quantified variables [2020-07-29 03:26:47,559 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 03:26:47,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 03:26:47,568 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 03:26:47,573 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 03:26:47,577 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 03:26:47,582 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 03:26:47,587 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 03:26:47,591 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 03:26:47,594 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 03:26:47,599 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 03:26:47,603 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 03:26:48,252 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2020-07-29 03:26:48,768 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-07-29 03:26:49,129 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:49,129 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:49,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:49,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:49,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:49,139 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:49,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:49,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:49,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:49,165 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:49,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:49,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:49,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:49,191 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:49,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:49,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:49,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:49,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:49,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:49,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:49,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:49,244 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:49,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:49,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:49,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:49,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:49,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:49,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:49,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:49,298 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:49,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:49,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:49,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:49,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:49,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:49,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:49,362 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:49,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:49,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:49,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:49,405 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 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:49,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,429 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:49,429 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:49,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:49,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:49,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:49,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:49,463 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:49,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:49,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:49,490 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:49,491 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,516 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:49,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:49,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:49,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:49,520 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:49,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:49,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:49,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:49,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:49,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:49,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:49,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:49,580 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:49,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:49,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:49,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:49,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:49,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:49,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:49,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:49,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:49,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,675 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:49,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:49,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:49,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:49,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:49,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:49,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:49,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,731 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:49,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:49,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:49,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:49,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:49,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:49,759 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:49,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:49,785 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:49,788 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 03:26:49,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:49,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:49,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:49,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:49,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:49,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:49,862 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:49,932 INFO L443 ModelExtractionUtils]: Simplification made 29 calls to the SMT solver. [2020-07-29 03:26:49,932 INFO L444 ModelExtractionUtils]: 34 out of 58 variables were initially zero. Simplification set additionally 21 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:49,934 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:49,937 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:49,938 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:49,938 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_2, ULTIMATE.start_cstrlen_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_2 - 1*ULTIMATE.start_cstrlen_~s~0.offset Supporting invariants [] [2020-07-29 03:26:50,099 INFO L297 tatePredicateManager]: 20 out of 22 supporting invariants were superfluous and have been removed [2020-07-29 03:26:50,106 INFO L393 LassoCheck]: Loop: "call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1);" "assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3;" "cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset;" [2020-07-29 03:26:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:50,111 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:26:50,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:50,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 03:26:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:50,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:50,211 INFO L280 TraceCheckUtils]: 0: Hoare triple {1586#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1586#unseeded} is VALID [2020-07-29 03:26:50,214 INFO L280 TraceCheckUtils]: 1: Hoare triple {1586#unseeded} havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; {1586#unseeded} is VALID [2020-07-29 03:26:50,214 INFO L280 TraceCheckUtils]: 2: Hoare triple {1586#unseeded} assume !(main_~length1~0 < 1); {1586#unseeded} is VALID [2020-07-29 03:26:50,215 INFO L280 TraceCheckUtils]: 3: Hoare triple {1586#unseeded} assume !(main_~length2~0 < 1); {1586#unseeded} is VALID [2020-07-29 03:26:50,220 INFO L280 TraceCheckUtils]: 4: Hoare triple {1586#unseeded} call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; {1586#unseeded} is VALID [2020-07-29 03:26:50,221 INFO L280 TraceCheckUtils]: 5: Hoare triple {1586#unseeded} assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; {1586#unseeded} is VALID [2020-07-29 03:26:50,222 INFO L280 TraceCheckUtils]: 6: Hoare triple {1586#unseeded} main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; {1586#unseeded} is VALID [2020-07-29 03:26:50,222 INFO L280 TraceCheckUtils]: 7: Hoare triple {1586#unseeded} assume !(main_~i~0 < main_~length1~0); {1586#unseeded} is VALID [2020-07-29 03:26:50,223 INFO L280 TraceCheckUtils]: 8: Hoare triple {1586#unseeded} main_~i~1 := 0; {1586#unseeded} is VALID [2020-07-29 03:26:50,223 INFO L280 TraceCheckUtils]: 9: Hoare triple {1586#unseeded} assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; {1586#unseeded} is VALID [2020-07-29 03:26:50,224 INFO L280 TraceCheckUtils]: 10: Hoare triple {1586#unseeded} main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; {1586#unseeded} is VALID [2020-07-29 03:26:50,224 INFO L280 TraceCheckUtils]: 11: Hoare triple {1586#unseeded} assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; {1586#unseeded} is VALID [2020-07-29 03:26:50,225 INFO L280 TraceCheckUtils]: 12: Hoare triple {1586#unseeded} main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; {1586#unseeded} is VALID [2020-07-29 03:26:50,226 INFO L280 TraceCheckUtils]: 13: Hoare triple {1586#unseeded} assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; {1586#unseeded} is VALID [2020-07-29 03:26:50,226 INFO L280 TraceCheckUtils]: 14: Hoare triple {1586#unseeded} main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; {1586#unseeded} is VALID [2020-07-29 03:26:50,227 INFO L280 TraceCheckUtils]: 15: Hoare triple {1586#unseeded} assume !(main_~i~1 < main_~length2~0); {1586#unseeded} is VALID [2020-07-29 03:26:50,228 INFO L280 TraceCheckUtils]: 16: Hoare triple {1586#unseeded} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; {1768#(and unseeded (= ULTIMATE.start_cstrstr_~find.base ULTIMATE.start_main_~nondetString2~0.base))} is VALID [2020-07-29 03:26:50,229 INFO L280 TraceCheckUtils]: 17: Hoare triple {1768#(and unseeded (= ULTIMATE.start_cstrstr_~find.base ULTIMATE.start_main_~nondetString2~0.base))} assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; {1711#(and (= ULTIMATE.start_cstrstr_~find.base ULTIMATE.start_cstrlen_~s~0.base) unseeded (= ULTIMATE.start_cstrstr_~find.base ULTIMATE.start_main_~nondetString2~0.base))} is VALID [2020-07-29 03:26:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:50,235 WARN L261 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:26:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:50,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:50,272 INFO L280 TraceCheckUtils]: 0: Hoare triple {1712#(and (>= oldRank0 (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (* (- 1) ULTIMATE.start_cstrlen_~s~0.offset))) (= ULTIMATE.start_cstrstr_~find.base ULTIMATE.start_cstrlen_~s~0.base) (= ULTIMATE.start_cstrstr_~find.base ULTIMATE.start_main_~nondetString2~0.base))} call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); {1772#(and (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_cstrlen_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrstr_~find.base ULTIMATE.start_cstrlen_~s~0.base) (<= (+ ULTIMATE.start_cstrlen_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrlen_~s~0.base)) (= ULTIMATE.start_cstrstr_~find.base ULTIMATE.start_main_~nondetString2~0.base))} is VALID [2020-07-29 03:26:50,273 INFO L280 TraceCheckUtils]: 1: Hoare triple {1772#(and (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_cstrlen_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrstr_~find.base ULTIMATE.start_cstrlen_~s~0.base) (<= (+ ULTIMATE.start_cstrlen_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrlen_~s~0.base)) (= ULTIMATE.start_cstrstr_~find.base ULTIMATE.start_main_~nondetString2~0.base))} assume !!(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; {1772#(and (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_cstrlen_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrstr_~find.base ULTIMATE.start_cstrlen_~s~0.base) (<= (+ ULTIMATE.start_cstrlen_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrlen_~s~0.base)) (= ULTIMATE.start_cstrstr_~find.base ULTIMATE.start_main_~nondetString2~0.base))} is VALID [2020-07-29 03:26:50,274 INFO L280 TraceCheckUtils]: 2: Hoare triple {1772#(and (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_cstrlen_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrstr_~find.base ULTIMATE.start_cstrlen_~s~0.base) (<= (+ ULTIMATE.start_cstrlen_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrlen_~s~0.base)) (= ULTIMATE.start_cstrstr_~find.base ULTIMATE.start_main_~nondetString2~0.base))} cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~s~0.base, 1 + cstrlen_~s~0.offset;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset; {1714#(and (= ULTIMATE.start_cstrstr_~find.base ULTIMATE.start_cstrlen_~s~0.base) (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (* (- 1) ULTIMATE.start_cstrlen_~s~0.offset)))) unseeded) (= ULTIMATE.start_cstrstr_~find.base ULTIMATE.start_main_~nondetString2~0.base))} is VALID [2020-07-29 03:26:50,275 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 03:26:50,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:26:50,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:50,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:50,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,295 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 03:26:50,295 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 52 transitions. cyclomatic complexity: 15 Second operand 4 states. [2020-07-29 03:26:50,502 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 52 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 61 states and 80 transitions. Complement of second has 5 states. [2020-07-29 03:26:50,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:50,502 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:50,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 52 transitions. cyclomatic complexity: 15 [2020-07-29 03:26:50,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:50,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:50,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:26:50,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:50,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:50,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:50,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 80 transitions. [2020-07-29 03:26:50,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 03:26:50,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:50,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:50,505 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 52 transitions. cyclomatic complexity: 15 [2020-07-29 03:26:50,508 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 17 examples of accepted words. [2020-07-29 03:26:50,508 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:26:50,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:50,509 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:50,509 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 61 states and 80 transitions. cyclomatic complexity: 24 [2020-07-29 03:26:50,512 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2020-07-29 03:26:50,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:50,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:50,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:50,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:50,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:50,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:50,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:26:50,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:26:50,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:26:50,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 61 letters. Loop has 61 letters. [2020-07-29 03:26:50,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 61 letters. Loop has 61 letters. [2020-07-29 03:26:50,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 61 letters. Loop has 61 letters. [2020-07-29 03:26:50,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:26:50,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:26:50,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:26:50,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:50,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:50,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:50,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:26:50,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:26:50,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:26:50,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:50,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:50,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:50,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 23 letters. Loop has 3 letters. [2020-07-29 03:26:50,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 23 letters. Loop has 3 letters. [2020-07-29 03:26:50,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 23 letters. Loop has 3 letters. [2020-07-29 03:26:50,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 26 letters. Loop has 8 letters. [2020-07-29 03:26:50,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 26 letters. Loop has 8 letters. [2020-07-29 03:26:50,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 26 letters. Loop has 8 letters. [2020-07-29 03:26:50,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 27 letters. Loop has 8 letters. [2020-07-29 03:26:50,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 27 letters. Loop has 8 letters. [2020-07-29 03:26:50,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 27 letters. Loop has 8 letters. [2020-07-29 03:26:50,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:50,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:50,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:50,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 28 letters. Loop has 5 letters. [2020-07-29 03:26:50,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 28 letters. Loop has 5 letters. [2020-07-29 03:26:50,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 28 letters. Loop has 5 letters. [2020-07-29 03:26:50,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 12 letters. [2020-07-29 03:26:50,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 29 letters. Loop has 12 letters. [2020-07-29 03:26:50,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 29 letters. Loop has 12 letters. [2020-07-29 03:26:50,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 5 letters. [2020-07-29 03:26:50,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 29 letters. Loop has 5 letters. [2020-07-29 03:26:50,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 29 letters. Loop has 5 letters. [2020-07-29 03:26:50,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 27 letters. Loop has 5 letters. [2020-07-29 03:26:50,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 27 letters. Loop has 5 letters. [2020-07-29 03:26:50,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 27 letters. Loop has 5 letters. [2020-07-29 03:26:50,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 30 letters. Loop has 5 letters. [2020-07-29 03:26:50,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 30 letters. Loop has 5 letters. [2020-07-29 03:26:50,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 30 letters. Loop has 5 letters. [2020-07-29 03:26:50,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 8 letters. [2020-07-29 03:26:50,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 25 letters. Loop has 8 letters. [2020-07-29 03:26:50,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 25 letters. Loop has 8 letters. [2020-07-29 03:26:50,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 26 letters. Loop has 5 letters. [2020-07-29 03:26:50,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 26 letters. Loop has 5 letters. [2020-07-29 03:26:50,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 26 letters. Loop has 5 letters. [2020-07-29 03:26:50,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 24 letters. Loop has 8 letters. [2020-07-29 03:26:50,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 24 letters. Loop has 8 letters. [2020-07-29 03:26:50,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 24 letters. Loop has 8 letters. [2020-07-29 03:26:50,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:50,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:50,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:50,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:50,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:50,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:50,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:50,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:50,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:50,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:50,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:50,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:50,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:50,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:50,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:50,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 23 letters. Loop has 3 letters. [2020-07-29 03:26:50,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 23 letters. Loop has 3 letters. [2020-07-29 03:26:50,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 23 letters. Loop has 3 letters. [2020-07-29 03:26:50,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 24 letters. Loop has 8 letters. [2020-07-29 03:26:50,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 24 letters. Loop has 8 letters. [2020-07-29 03:26:50,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 24 letters. Loop has 8 letters. [2020-07-29 03:26:50,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 8 letters. [2020-07-29 03:26:50,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 25 letters. Loop has 8 letters. [2020-07-29 03:26:50,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 25 letters. Loop has 8 letters. [2020-07-29 03:26:50,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 26 letters. Loop has 8 letters. [2020-07-29 03:26:50,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 26 letters. Loop has 8 letters. [2020-07-29 03:26:50,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 26 letters. Loop has 8 letters. [2020-07-29 03:26:50,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 26 letters. Loop has 5 letters. [2020-07-29 03:26:50,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 26 letters. Loop has 5 letters. [2020-07-29 03:26:50,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 26 letters. Loop has 5 letters. [2020-07-29 03:26:50,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 27 letters. Loop has 8 letters. [2020-07-29 03:26:50,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 27 letters. Loop has 8 letters. [2020-07-29 03:26:50,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 27 letters. Loop has 8 letters. [2020-07-29 03:26:50,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 27 letters. Loop has 5 letters. [2020-07-29 03:26:50,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 27 letters. Loop has 5 letters. [2020-07-29 03:26:50,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 27 letters. Loop has 5 letters. [2020-07-29 03:26:50,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 28 letters. Loop has 5 letters. [2020-07-29 03:26:50,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 28 letters. Loop has 5 letters. [2020-07-29 03:26:50,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 28 letters. Loop has 5 letters. [2020-07-29 03:26:50,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 12 letters. [2020-07-29 03:26:50,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 29 letters. Loop has 12 letters. [2020-07-29 03:26:50,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 29 letters. Loop has 12 letters. [2020-07-29 03:26:50,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 5 letters. [2020-07-29 03:26:50,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 29 letters. Loop has 5 letters. [2020-07-29 03:26:50,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 29 letters. Loop has 5 letters. [2020-07-29 03:26:50,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 30 letters. Loop has 5 letters. [2020-07-29 03:26:50,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 30 letters. Loop has 5 letters. [2020-07-29 03:26:50,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 30 letters. Loop has 5 letters. [2020-07-29 03:26:50,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:26:50,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:26:50,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 20 letters. Loop has 8 letters. [2020-07-29 03:26:50,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 52 transitions. cyclomatic complexity: 15 Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:50,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:50,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 61 states and 80 transitions. cyclomatic complexity: 24 Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:50,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,544 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:26:50,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2020-07-29 03:26:50,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:50,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:50,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 18 letters. Loop has 6 letters. [2020-07-29 03:26:50,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:50,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 80 transitions. cyclomatic complexity: 24 [2020-07-29 03:26:50,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 03:26:50,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 43 states and 55 transitions. [2020-07-29 03:26:50,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-07-29 03:26:50,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-07-29 03:26:50,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 55 transitions. [2020-07-29 03:26:50,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:50,550 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 55 transitions. [2020-07-29 03:26:50,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 55 transitions. [2020-07-29 03:26:50,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2020-07-29 03:26:50,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:50,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states and 55 transitions. Second operand 42 states. [2020-07-29 03:26:50,553 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states and 55 transitions. Second operand 42 states. [2020-07-29 03:26:50,553 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 42 states. [2020-07-29 03:26:50,554 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:50,557 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2020-07-29 03:26:50,558 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2020-07-29 03:26:50,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:50,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:50,558 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states and 55 transitions. [2020-07-29 03:26:50,558 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states and 55 transitions. [2020-07-29 03:26:50,559 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:50,562 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2020-07-29 03:26:50,562 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2020-07-29 03:26:50,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:50,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:50,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:50,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-29 03:26:50,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2020-07-29 03:26:50,564 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2020-07-29 03:26:50,564 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2020-07-29 03:26:50,564 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 03:26:50,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 54 transitions. [2020-07-29 03:26:50,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-29 03:26:50,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:50,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:50,565 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:50,565 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:50,566 INFO L794 eck$LassoCheckResult]: Stem: 1880#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1859#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 1851#L555 assume !(main_~length1~0 < 1); 1852#L555-2 assume !(main_~length2~0 < 1); 1870#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 1871#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 1882#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 1883#L564-3 assume !(main_~i~0 < main_~length1~0); 1884#L564-4 main_~i~1 := 0; 1855#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 1849#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 1850#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 1856#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 1890#L568-3 assume !(main_~i~1 < main_~length2~0); 1878#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 1879#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 1872#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 1873#L518-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 1875#L518-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 1876#L520 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 1881#L542-4 [2020-07-29 03:26:50,566 INFO L796 eck$LassoCheckResult]: Loop: 1881#L542-4 goto; 1860#L543-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 1853#L544 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 1854#L543 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 1877#L542-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 1868#L525 assume 0 == cstrncmp_~n % 4294967296;cstrncmp_#res := 0; 1857#L533 cstrstr_#t~ret16 := cstrncmp_#res; 1858#L542-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 1881#L542-4 [2020-07-29 03:26:50,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:50,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1849679959, now seen corresponding path program 1 times [2020-07-29 03:26:50,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:50,567 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307914531] [2020-07-29 03:26:50,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:50,583 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:50,597 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:50,602 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:50,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:50,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1079765744, now seen corresponding path program 1 times [2020-07-29 03:26:50,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:50,603 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352945903] [2020-07-29 03:26:50,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:50,669 INFO L280 TraceCheckUtils]: 0: Hoare triple {2120#true} goto; {2120#true} is VALID [2020-07-29 03:26:50,670 INFO L280 TraceCheckUtils]: 1: Hoare triple {2120#true} cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; {2120#true} is VALID [2020-07-29 03:26:50,670 INFO L280 TraceCheckUtils]: 2: Hoare triple {2120#true} assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; {2120#true} is VALID [2020-07-29 03:26:50,670 INFO L280 TraceCheckUtils]: 3: Hoare triple {2120#true} assume !(cstrstr_~sc~0 != cstrstr_~c~0); {2120#true} is VALID [2020-07-29 03:26:50,670 INFO L280 TraceCheckUtils]: 4: Hoare triple {2120#true} cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; {2120#true} is VALID [2020-07-29 03:26:50,676 INFO L280 TraceCheckUtils]: 5: Hoare triple {2120#true} assume 0 == cstrncmp_~n % 4294967296;cstrncmp_#res := 0; {2122#(= 0 |ULTIMATE.start_cstrncmp_#res|)} is VALID [2020-07-29 03:26:50,677 INFO L280 TraceCheckUtils]: 6: Hoare triple {2122#(= 0 |ULTIMATE.start_cstrncmp_#res|)} cstrstr_#t~ret16 := cstrncmp_#res; {2123#(= 0 |ULTIMATE.start_cstrstr_#t~ret16|)} is VALID [2020-07-29 03:26:50,678 INFO L280 TraceCheckUtils]: 7: Hoare triple {2123#(= 0 |ULTIMATE.start_cstrstr_#t~ret16|)} assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; {2121#false} is VALID [2020-07-29 03:26:50,678 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 03:26:50,678 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352945903] [2020-07-29 03:26:50,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:50,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:26:50,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110916717] [2020-07-29 03:26:50,679 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:26:50,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:50,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:26:50,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:26:50,680 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. cyclomatic complexity: 16 Second operand 4 states. [2020-07-29 03:26:50,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:50,785 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2020-07-29 03:26:50,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:26:50,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:26:50,795 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 03:26:50,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 55 transitions. [2020-07-29 03:26:50,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 03:26:50,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 41 states and 50 transitions. [2020-07-29 03:26:50,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-07-29 03:26:50,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-07-29 03:26:50,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 50 transitions. [2020-07-29 03:26:50,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:50,801 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2020-07-29 03:26:50,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 50 transitions. [2020-07-29 03:26:50,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-29 03:26:50,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:50,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states and 50 transitions. Second operand 41 states. [2020-07-29 03:26:50,804 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states and 50 transitions. Second operand 41 states. [2020-07-29 03:26:50,804 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 41 states. [2020-07-29 03:26:50,805 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:50,807 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2020-07-29 03:26:50,807 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2020-07-29 03:26:50,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:50,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:50,808 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states and 50 transitions. [2020-07-29 03:26:50,808 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states and 50 transitions. [2020-07-29 03:26:50,809 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:50,811 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2020-07-29 03:26:50,812 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2020-07-29 03:26:50,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:50,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:50,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:50,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:50,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-29 03:26:50,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2020-07-29 03:26:50,814 INFO L711 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2020-07-29 03:26:50,814 INFO L591 BuchiCegarLoop]: Abstraction has 41 states and 50 transitions. [2020-07-29 03:26:50,814 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 03:26:50,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 50 transitions. [2020-07-29 03:26:50,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 03:26:50,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:50,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:50,816 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:50,816 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:50,816 INFO L794 eck$LassoCheckResult]: Stem: 2201#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2181#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 2172#L555 assume !(main_~length1~0 < 1); 2173#L555-2 assume !(main_~length2~0 < 1); 2189#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 2190#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 2203#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 2204#L564-3 assume !(main_~i~0 < main_~length1~0); 2206#L564-4 main_~i~1 := 0; 2176#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 2177#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 2178#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 2170#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 2171#L568-3 assume !(main_~i~1 < main_~length2~0); 2208#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 2205#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 2193#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 2194#L518-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 2196#L518-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 2197#L520 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 2202#L542-4 [2020-07-29 03:26:50,817 INFO L796 eck$LassoCheckResult]: Loop: 2202#L542-4 goto; 2182#L543-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 2174#L544 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 2175#L543 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 2198#L542-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 2191#L525 assume !(0 == cstrncmp_~n % 4294967296); 2192#L527-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 2185#L528 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1);cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~mem9;havoc cstrncmp_#t~mem10;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset; 2179#L533 cstrstr_#t~ret16 := cstrncmp_#res; 2180#L542-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 2202#L542-4 [2020-07-29 03:26:50,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:50,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1849679959, now seen corresponding path program 2 times [2020-07-29 03:26:50,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:50,818 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633371278] [2020-07-29 03:26:50,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:50,833 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:50,847 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:50,852 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:50,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:50,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1728347221, now seen corresponding path program 1 times [2020-07-29 03:26:50,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:50,854 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306291202] [2020-07-29 03:26:50,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:50,865 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:50,873 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:50,876 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:50,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:50,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1941989675, now seen corresponding path program 1 times [2020-07-29 03:26:50,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:50,878 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191244623] [2020-07-29 03:26:50,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:51,051 INFO L280 TraceCheckUtils]: 0: Hoare triple {2438#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2438#true} is VALID [2020-07-29 03:26:51,052 INFO L280 TraceCheckUtils]: 1: Hoare triple {2438#true} havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; {2438#true} is VALID [2020-07-29 03:26:51,052 INFO L280 TraceCheckUtils]: 2: Hoare triple {2438#true} assume !(main_~length1~0 < 1); {2438#true} is VALID [2020-07-29 03:26:51,052 INFO L280 TraceCheckUtils]: 3: Hoare triple {2438#true} assume !(main_~length2~0 < 1); {2438#true} is VALID [2020-07-29 03:26:51,054 INFO L280 TraceCheckUtils]: 4: Hoare triple {2438#true} call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; {2440#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 03:26:51,055 INFO L280 TraceCheckUtils]: 5: Hoare triple {2440#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; {2440#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 03:26:51,057 INFO L280 TraceCheckUtils]: 6: Hoare triple {2440#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 ULTIMATE.start_main_~i~0))} main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; {2441#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 03:26:51,058 INFO L280 TraceCheckUtils]: 7: Hoare triple {2441#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= ULTIMATE.start_main_~i~0 1))} assume !(main_~i~0 < main_~length1~0); {2442#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1))} is VALID [2020-07-29 03:26:51,059 INFO L280 TraceCheckUtils]: 8: Hoare triple {2442#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1))} main_~i~1 := 0; {2442#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1))} is VALID [2020-07-29 03:26:51,060 INFO L280 TraceCheckUtils]: 9: Hoare triple {2442#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1))} assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; {2442#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1))} is VALID [2020-07-29 03:26:51,061 INFO L280 TraceCheckUtils]: 10: Hoare triple {2442#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1))} main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; {2442#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1))} is VALID [2020-07-29 03:26:51,062 INFO L280 TraceCheckUtils]: 11: Hoare triple {2442#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1))} assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; {2442#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1))} is VALID [2020-07-29 03:26:51,063 INFO L280 TraceCheckUtils]: 12: Hoare triple {2442#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1))} main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; {2442#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1))} is VALID [2020-07-29 03:26:51,064 INFO L280 TraceCheckUtils]: 13: Hoare triple {2442#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1))} assume !(main_~i~1 < main_~length2~0); {2442#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1))} is VALID [2020-07-29 03:26:51,066 INFO L280 TraceCheckUtils]: 14: Hoare triple {2442#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; {2443#(and (= ULTIMATE.start_cstrstr_~s.offset 0) (<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1))} is VALID [2020-07-29 03:26:51,067 INFO L280 TraceCheckUtils]: 15: Hoare triple {2443#(and (= ULTIMATE.start_cstrstr_~s.offset 0) (<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1))} assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; {2443#(and (= ULTIMATE.start_cstrstr_~s.offset 0) (<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1))} is VALID [2020-07-29 03:26:51,068 INFO L280 TraceCheckUtils]: 16: Hoare triple {2443#(and (= ULTIMATE.start_cstrstr_~s.offset 0) (<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1))} call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); {2443#(and (= ULTIMATE.start_cstrstr_~s.offset 0) (<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1))} is VALID [2020-07-29 03:26:51,069 INFO L280 TraceCheckUtils]: 17: Hoare triple {2443#(and (= ULTIMATE.start_cstrstr_~s.offset 0) (<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1))} assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; {2443#(and (= ULTIMATE.start_cstrstr_~s.offset 0) (<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1))} is VALID [2020-07-29 03:26:51,070 INFO L280 TraceCheckUtils]: 18: Hoare triple {2443#(and (= ULTIMATE.start_cstrstr_~s.offset 0) (<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1))} assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); {2443#(and (= ULTIMATE.start_cstrstr_~s.offset 0) (<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1))} is VALID [2020-07-29 03:26:51,071 INFO L280 TraceCheckUtils]: 19: Hoare triple {2443#(and (= ULTIMATE.start_cstrstr_~s.offset 0) (<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1))} cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; {2443#(and (= ULTIMATE.start_cstrstr_~s.offset 0) (<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1))} is VALID [2020-07-29 03:26:51,072 INFO L280 TraceCheckUtils]: 20: Hoare triple {2443#(and (= ULTIMATE.start_cstrstr_~s.offset 0) (<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1))} goto; {2443#(and (= ULTIMATE.start_cstrstr_~s.offset 0) (<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1))} is VALID [2020-07-29 03:26:51,073 INFO L280 TraceCheckUtils]: 21: Hoare triple {2443#(and (= ULTIMATE.start_cstrstr_~s.offset 0) (<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1))} cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; {2444#(<= (select |#length| ULTIMATE.start_cstrstr_~s.base) ULTIMATE.start_cstrstr_~s.offset)} is VALID [2020-07-29 03:26:51,074 INFO L280 TraceCheckUtils]: 22: Hoare triple {2444#(<= (select |#length| ULTIMATE.start_cstrstr_~s.base) ULTIMATE.start_cstrstr_~s.offset)} assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; {2444#(<= (select |#length| ULTIMATE.start_cstrstr_~s.base) ULTIMATE.start_cstrstr_~s.offset)} is VALID [2020-07-29 03:26:51,075 INFO L280 TraceCheckUtils]: 23: Hoare triple {2444#(<= (select |#length| ULTIMATE.start_cstrstr_~s.base) ULTIMATE.start_cstrstr_~s.offset)} assume !(cstrstr_~sc~0 != cstrstr_~c~0); {2444#(<= (select |#length| ULTIMATE.start_cstrstr_~s.base) ULTIMATE.start_cstrstr_~s.offset)} is VALID [2020-07-29 03:26:51,078 INFO L280 TraceCheckUtils]: 24: Hoare triple {2444#(<= (select |#length| ULTIMATE.start_cstrstr_~s.base) ULTIMATE.start_cstrstr_~s.offset)} cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; {2445#(<= (select |#length| ULTIMATE.start_cstrncmp_~s1.base) ULTIMATE.start_cstrncmp_~s1.offset)} is VALID [2020-07-29 03:26:51,079 INFO L280 TraceCheckUtils]: 25: Hoare triple {2445#(<= (select |#length| ULTIMATE.start_cstrncmp_~s1.base) ULTIMATE.start_cstrncmp_~s1.offset)} assume !(0 == cstrncmp_~n % 4294967296); {2445#(<= (select |#length| ULTIMATE.start_cstrncmp_~s1.base) ULTIMATE.start_cstrncmp_~s1.offset)} is VALID [2020-07-29 03:26:51,081 INFO L280 TraceCheckUtils]: 26: Hoare triple {2445#(<= (select |#length| ULTIMATE.start_cstrncmp_~s1.base) ULTIMATE.start_cstrncmp_~s1.offset)} call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); {2439#false} is VALID [2020-07-29 03:26:51,081 INFO L280 TraceCheckUtils]: 27: Hoare triple {2439#false} assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1);cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~mem9;havoc cstrncmp_#t~mem10;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset; {2439#false} is VALID [2020-07-29 03:26:51,081 INFO L280 TraceCheckUtils]: 28: Hoare triple {2439#false} cstrstr_#t~ret16 := cstrncmp_#res; {2439#false} is VALID [2020-07-29 03:26:51,082 INFO L280 TraceCheckUtils]: 29: Hoare triple {2439#false} assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; {2439#false} is VALID [2020-07-29 03:26:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-29 03:26:51,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191244623] [2020-07-29 03:26:51,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633063860] [2020-07-29 03:26:51,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:26:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:51,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 24 conjunts are in the unsatisfiable core [2020-07-29 03:26:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:51,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:51,201 INFO L440 ElimStorePlain]: Different costs {0=[|v_#length_97|], 1=[|v_#valid_117|]} [2020-07-29 03:26:51,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 03:26:51,206 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2020-07-29 03:26:51,207 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:26:51,217 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:51,226 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-29 03:26:51,230 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-29 03:26:51,238 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:51,248 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:26:51,248 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:21, output treesize:9 [2020-07-29 03:26:51,252 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:26:51,252 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_97|, |ULTIMATE.start_main_#t~malloc23.base|, ULTIMATE.start_main_~length2~0, |v_#valid_117|]. (and (= (store (store |v_#length_97| ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~length1~0) |ULTIMATE.start_main_#t~malloc23.base| ULTIMATE.start_main_~length2~0) |#length|) (<= ULTIMATE.start_main_~i~0 0) (<= (select (store |v_#valid_117| ULTIMATE.start_main_~nondetString1~0.base 1) |ULTIMATE.start_main_#t~malloc23.base|) 0)) [2020-07-29 03:26:51,252 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~0 0)) [2020-07-29 03:26:51,538 INFO L280 TraceCheckUtils]: 0: Hoare triple {2438#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2438#true} is VALID [2020-07-29 03:26:51,539 INFO L280 TraceCheckUtils]: 1: Hoare triple {2438#true} havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; {2438#true} is VALID [2020-07-29 03:26:51,539 INFO L280 TraceCheckUtils]: 2: Hoare triple {2438#true} assume !(main_~length1~0 < 1); {2438#true} is VALID [2020-07-29 03:26:51,540 INFO L280 TraceCheckUtils]: 3: Hoare triple {2438#true} assume !(main_~length2~0 < 1); {2438#true} is VALID [2020-07-29 03:26:51,542 INFO L280 TraceCheckUtils]: 4: Hoare triple {2438#true} call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; {2461#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~0 0))} is VALID [2020-07-29 03:26:51,543 INFO L280 TraceCheckUtils]: 5: Hoare triple {2461#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~0 0))} assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; {2461#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~0 0))} is VALID [2020-07-29 03:26:51,544 INFO L280 TraceCheckUtils]: 6: Hoare triple {2461#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~0 0))} main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; {2468#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 03:26:51,545 INFO L280 TraceCheckUtils]: 7: Hoare triple {2468#(and (= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~0 1))} assume !(main_~i~0 < main_~length1~0); {2472#(<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1)} is VALID [2020-07-29 03:26:51,545 INFO L280 TraceCheckUtils]: 8: Hoare triple {2472#(<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1)} main_~i~1 := 0; {2472#(<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1)} is VALID [2020-07-29 03:26:51,546 INFO L280 TraceCheckUtils]: 9: Hoare triple {2472#(<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1)} assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; {2472#(<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1)} is VALID [2020-07-29 03:26:51,546 INFO L280 TraceCheckUtils]: 10: Hoare triple {2472#(<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1)} main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; {2472#(<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1)} is VALID [2020-07-29 03:26:51,547 INFO L280 TraceCheckUtils]: 11: Hoare triple {2472#(<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1)} assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; {2472#(<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1)} is VALID [2020-07-29 03:26:51,547 INFO L280 TraceCheckUtils]: 12: Hoare triple {2472#(<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1)} main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; {2472#(<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1)} is VALID [2020-07-29 03:26:51,548 INFO L280 TraceCheckUtils]: 13: Hoare triple {2472#(<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1)} assume !(main_~i~1 < main_~length2~0); {2472#(<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1)} is VALID [2020-07-29 03:26:51,549 INFO L280 TraceCheckUtils]: 14: Hoare triple {2472#(<= (select |#length| ULTIMATE.start_main_~nondetString1~0.base) 1)} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; {2494#(<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1)} is VALID [2020-07-29 03:26:51,550 INFO L280 TraceCheckUtils]: 15: Hoare triple {2494#(<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1)} assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; {2494#(<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1)} is VALID [2020-07-29 03:26:51,551 INFO L280 TraceCheckUtils]: 16: Hoare triple {2494#(<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1)} call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); {2494#(<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1)} is VALID [2020-07-29 03:26:51,551 INFO L280 TraceCheckUtils]: 17: Hoare triple {2494#(<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1)} assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; {2494#(<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1)} is VALID [2020-07-29 03:26:51,552 INFO L280 TraceCheckUtils]: 18: Hoare triple {2494#(<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1)} assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); {2494#(<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1)} is VALID [2020-07-29 03:26:51,552 INFO L280 TraceCheckUtils]: 19: Hoare triple {2494#(<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1)} cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; {2494#(<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1)} is VALID [2020-07-29 03:26:51,553 INFO L280 TraceCheckUtils]: 20: Hoare triple {2494#(<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1)} goto; {2494#(<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1)} is VALID [2020-07-29 03:26:51,554 INFO L280 TraceCheckUtils]: 21: Hoare triple {2494#(<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1)} cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; {2516#(and (<= 1 ULTIMATE.start_cstrstr_~s.offset) (<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1))} is VALID [2020-07-29 03:26:51,554 INFO L280 TraceCheckUtils]: 22: Hoare triple {2516#(and (<= 1 ULTIMATE.start_cstrstr_~s.offset) (<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1))} assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; {2516#(and (<= 1 ULTIMATE.start_cstrstr_~s.offset) (<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1))} is VALID [2020-07-29 03:26:51,555 INFO L280 TraceCheckUtils]: 23: Hoare triple {2516#(and (<= 1 ULTIMATE.start_cstrstr_~s.offset) (<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1))} assume !(cstrstr_~sc~0 != cstrstr_~c~0); {2516#(and (<= 1 ULTIMATE.start_cstrstr_~s.offset) (<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1))} is VALID [2020-07-29 03:26:51,556 INFO L280 TraceCheckUtils]: 24: Hoare triple {2516#(and (<= 1 ULTIMATE.start_cstrstr_~s.offset) (<= (select |#length| ULTIMATE.start_cstrstr_~s.base) 1))} cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; {2526#(and (<= (select |#length| ULTIMATE.start_cstrncmp_~s1.base) 1) (<= 1 ULTIMATE.start_cstrncmp_~s1.offset))} is VALID [2020-07-29 03:26:51,557 INFO L280 TraceCheckUtils]: 25: Hoare triple {2526#(and (<= (select |#length| ULTIMATE.start_cstrncmp_~s1.base) 1) (<= 1 ULTIMATE.start_cstrncmp_~s1.offset))} assume !(0 == cstrncmp_~n % 4294967296); {2526#(and (<= (select |#length| ULTIMATE.start_cstrncmp_~s1.base) 1) (<= 1 ULTIMATE.start_cstrncmp_~s1.offset))} is VALID [2020-07-29 03:26:51,558 INFO L280 TraceCheckUtils]: 26: Hoare triple {2526#(and (<= (select |#length| ULTIMATE.start_cstrncmp_~s1.base) 1) (<= 1 ULTIMATE.start_cstrncmp_~s1.offset))} call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); {2439#false} is VALID [2020-07-29 03:26:51,558 INFO L280 TraceCheckUtils]: 27: Hoare triple {2439#false} assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1);cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~mem9;havoc cstrncmp_#t~mem10;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset; {2439#false} is VALID [2020-07-29 03:26:51,558 INFO L280 TraceCheckUtils]: 28: Hoare triple {2439#false} cstrstr_#t~ret16 := cstrncmp_#res; {2439#false} is VALID [2020-07-29 03:26:51,558 INFO L280 TraceCheckUtils]: 29: Hoare triple {2439#false} assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; {2439#false} is VALID [2020-07-29 03:26:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-29 03:26:51,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:26:51,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2020-07-29 03:26:51,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694557371] [2020-07-29 03:26:51,876 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2020-07-29 03:26:51,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:51,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-29 03:26:51,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-07-29 03:26:51,995 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. cyclomatic complexity: 13 Second operand 14 states. [2020-07-29 03:26:52,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:52,691 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2020-07-29 03:26:52,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 03:26:52,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-29 03:26:52,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:52,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 85 transitions. [2020-07-29 03:26:52,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 03:26:52,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 44 states and 53 transitions. [2020-07-29 03:26:52,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2020-07-29 03:26:52,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2020-07-29 03:26:52,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 53 transitions. [2020-07-29 03:26:52,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:52,778 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 53 transitions. [2020-07-29 03:26:52,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 53 transitions. [2020-07-29 03:26:52,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2020-07-29 03:26:52,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:52,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states and 53 transitions. Second operand 43 states. [2020-07-29 03:26:52,781 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states and 53 transitions. Second operand 43 states. [2020-07-29 03:26:52,781 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 43 states. [2020-07-29 03:26:52,782 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:52,784 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2020-07-29 03:26:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2020-07-29 03:26:52,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:52,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:52,784 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states and 53 transitions. [2020-07-29 03:26:52,785 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states and 53 transitions. [2020-07-29 03:26:52,785 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:52,787 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2020-07-29 03:26:52,787 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2020-07-29 03:26:52,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:52,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:52,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:52,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-29 03:26:52,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2020-07-29 03:26:52,789 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2020-07-29 03:26:52,790 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2020-07-29 03:26:52,790 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 03:26:52,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2020-07-29 03:26:52,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-07-29 03:26:52,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:52,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:52,791 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:52,791 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:52,791 INFO L794 eck$LassoCheckResult]: Stem: 2649#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2629#L-1 havoc main_#res;havoc main_#t~nondet20, main_#t~nondet21, main_#t~malloc22.base, main_#t~malloc22.offset, main_#t~malloc23.base, main_#t~malloc23.offset, main_#t~nondet25, main_#t~post24, main_~i~0, main_#t~nondet27, main_#t~post26, main_~i~1, main_#t~ret28.base, main_#t~ret28.offset, main_~length1~0, main_~length2~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet20;havoc main_#t~nondet20;main_~length2~0 := main_#t~nondet21;havoc main_#t~nondet21; 2621#L555 assume !(main_~length1~0 < 1); 2622#L555-2 assume !(main_~length2~0 < 1); 2637#L558-1 call main_#t~malloc22.base, main_#t~malloc22.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc22.base, main_#t~malloc22.offset;call main_#t~malloc23.base, main_#t~malloc23.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc23.base, main_#t~malloc23.offset;main_~i~0 := 0; 2638#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 2651#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 2652#L564-3 assume !!(main_~i~0 < main_~length1~0);call write~int(main_#t~nondet25, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet25; 2653#L564-2 main_#t~post24 := main_~i~0;main_~i~0 := 1 + main_#t~post24;havoc main_#t~post24; 2655#L564-3 assume !(main_~i~0 < main_~length1~0); 2654#L564-4 main_~i~1 := 0; 2625#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 2619#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 2620#L568-3 assume !!(main_~i~1 < main_~length2~0);call write~int(main_#t~nondet27, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet27; 2626#L568-2 main_#t~post26 := main_~i~1;main_~i~1 := 1 + main_#t~post26;havoc main_#t~post26; 2661#L568-3 assume !(main_~i~1 < main_~length2~0); 2647#L568-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrstr_#in~s.base, cstrstr_#in~s.offset, cstrstr_#in~find.base, cstrstr_#in~find.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrstr_#res.base, cstrstr_#res.offset;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset, cstrstr_#t~mem14, cstrstr_#t~ret15, cstrstr_#t~post17.base, cstrstr_#t~post17.offset, cstrstr_#t~mem18, cstrstr_#t~ret16, cstrstr_#t~post19.base, cstrstr_#t~post19.offset, cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~c~0, cstrstr_~sc~0, cstrstr_~len~0;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#in~s.base, cstrstr_#in~s.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#in~find.base, cstrstr_#in~find.offset;havoc cstrstr_~c~0;havoc cstrstr_~sc~0;havoc cstrstr_~len~0;cstrstr_#t~post13.base, cstrstr_#t~post13.offset := cstrstr_~find.base, cstrstr_~find.offset;cstrstr_~find.base, cstrstr_~find.offset := cstrstr_#t~post13.base, 1 + cstrstr_#t~post13.offset;call cstrstr_#t~mem14 := read~int(cstrstr_#t~post13.base, cstrstr_#t~post13.offset, 1);cstrstr_~c~0 := cstrstr_#t~mem14; 2648#L540 assume 0 != cstrstr_~c~0;havoc cstrstr_#t~post13.base, cstrstr_#t~post13.offset;havoc cstrstr_#t~mem14;cstrlen_#in~str.base, cstrlen_#in~str.offset := cstrstr_~find.base, cstrstr_~find.offset;havoc cstrlen_#res;havoc cstrlen_#t~pre2.base, cstrlen_#t~pre2.offset, cstrlen_#t~mem3, cstrlen_~str.base, cstrlen_~str.offset, cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~str.base, cstrlen_~str.offset := cstrlen_#in~str.base, cstrlen_#in~str.offset;havoc cstrlen_~s~0.base, cstrlen_~s~0.offset;cstrlen_~s~0.base, cstrlen_~s~0.offset := cstrlen_~str.base, cstrlen_~str.offset; 2641#L518-4 call cstrlen_#t~mem3 := read~int(cstrlen_~s~0.base, cstrlen_~s~0.offset, 1); 2642#L518-1 assume !(0 != cstrlen_#t~mem3);havoc cstrlen_#t~mem3; 2644#L518-5 assume cstrlen_~s~0.base == cstrlen_~str.base;cstrlen_#res := (if cstrlen_~s~0.offset - cstrlen_~str.offset < 0 && 0 != (cstrlen_~s~0.offset - cstrlen_~str.offset) % 1 then 1 + (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1 else (cstrlen_~s~0.offset - cstrlen_~str.offset) / 1); 2645#L520 cstrstr_#t~ret15 := cstrlen_#res;cstrstr_~len~0 := cstrstr_#t~ret15;havoc cstrstr_#t~ret15; 2650#L542-4 [2020-07-29 03:26:52,792 INFO L796 eck$LassoCheckResult]: Loop: 2650#L542-4 goto; 2630#L543-2 cstrstr_#t~post17.base, cstrstr_#t~post17.offset := cstrstr_~s.base, cstrstr_~s.offset;cstrstr_~s.base, cstrstr_~s.offset := cstrstr_#t~post17.base, 1 + cstrstr_#t~post17.offset;call cstrstr_#t~mem18 := read~int(cstrstr_#t~post17.base, cstrstr_#t~post17.offset, 1);cstrstr_~sc~0 := cstrstr_#t~mem18; 2623#L544 assume !(0 == cstrstr_~sc~0);havoc cstrstr_#t~post17.base, cstrstr_#t~post17.offset;havoc cstrstr_#t~mem18; 2624#L543 assume !(cstrstr_~sc~0 != cstrstr_~c~0); 2646#L542-1 cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset, cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset, cstrncmp_#in~n := cstrstr_~s.base, cstrstr_~s.offset, cstrstr_~find.base, cstrstr_~find.offset, cstrstr_~len~0;havoc cstrncmp_#res;havoc cstrncmp_#t~mem6, cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, cstrncmp_#t~mem7, cstrncmp_#t~mem9, cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, cstrncmp_#t~mem10, cstrncmp_#t~post11.base, cstrncmp_#t~post11.offset, cstrncmp_#t~mem12, cstrncmp_#t~pre4, cstrncmp_~s1.base, cstrncmp_~s1.offset, cstrncmp_~s2.base, cstrncmp_~s2.offset, cstrncmp_~n;cstrncmp_~s1.base, cstrncmp_~s1.offset := cstrncmp_#in~s1.base, cstrncmp_#in~s1.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#in~s2.base, cstrncmp_#in~s2.offset;cstrncmp_~n := cstrncmp_#in~n; 2639#L525 assume !(0 == cstrncmp_~n % 4294967296); 2640#L527-4 call cstrncmp_#t~mem6 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_#t~post5.base, 1 + cstrncmp_#t~post5.offset;call cstrncmp_#t~mem7 := read~int(cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset, 1); 2633#L528 assume cstrncmp_#t~mem6 != cstrncmp_#t~mem7;havoc cstrncmp_#t~post5.base, cstrncmp_#t~post5.offset;havoc cstrncmp_#t~mem6;havoc cstrncmp_#t~mem7;call cstrncmp_#t~mem9 := read~int(cstrncmp_~s1.base, cstrncmp_~s1.offset, 1);cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;cstrncmp_~s2.base, cstrncmp_~s2.offset := cstrncmp_~s2.base, cstrncmp_~s2.offset - 1;call cstrncmp_#t~mem10 := read~int(cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset, 1);cstrncmp_#res := cstrncmp_#t~mem9 % 256 - cstrncmp_#t~mem10 % 256;havoc cstrncmp_#t~mem9;havoc cstrncmp_#t~mem10;havoc cstrncmp_#t~pre8.base, cstrncmp_#t~pre8.offset; 2627#L533 cstrstr_#t~ret16 := cstrncmp_#res; 2628#L542-2 assume !!(0 != cstrstr_#t~ret16);havoc cstrstr_#t~ret16; 2650#L542-4 [2020-07-29 03:26:52,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:52,792 INFO L82 PathProgramCache]: Analyzing trace with hash 195946165, now seen corresponding path program 3 times [2020-07-29 03:26:52,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:52,793 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543006640] [2020-07-29 03:26:52,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:52,807 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:52,821 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:52,825 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:52,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:52,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1728347221, now seen corresponding path program 2 times [2020-07-29 03:26:52,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:52,827 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087203875] [2020-07-29 03:26:52,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:52,835 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:52,842 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:52,845 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:52,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:52,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1478979063, now seen corresponding path program 2 times [2020-07-29 03:26:52,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:52,846 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847110372] [2020-07-29 03:26:52,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:52,879 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.checkConcatFeasibility(LassoCheck.java:899) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:832) 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 03:26:52,889 INFO L168 Benchmark]: Toolchain (without parser) took 23946.13 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 481.8 MB). Free memory was 954.9 MB in the beginning and 1.0 GB in the end (delta: -59.6 MB). Peak memory consumption was 422.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:52,890 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:52,890 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -163.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:52,890 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.39 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 03:26:52,891 INFO L168 Benchmark]: Boogie Preprocessor took 37.58 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 03:26:52,891 INFO L168 Benchmark]: RCFGBuilder took 663.69 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: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:52,892 INFO L168 Benchmark]: BuchiAutomizer took 22425.90 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 333.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.4 MB). Peak memory consumption was 385.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:52,896 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 753.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -163.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.58 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 663.69 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: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22425.90 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 333.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.4 MB). Peak memory consumption was 385.9 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...