./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 31b6f06b720558e9a2e510f7cce25403bea703ef ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:39:49,615 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:39:49,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:39:49,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:39:49,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:39:49,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:39:49,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:39:49,636 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:39:49,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:39:49,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:39:49,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:39:49,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:39:49,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:39:49,643 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:39:49,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:39:49,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:39:49,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:39:49,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:39:49,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:39:49,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:39:49,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:39:49,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:39:49,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:39:49,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:39:49,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:39:49,678 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:39:49,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:39:49,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:39:49,681 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:39:49,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:39:49,683 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:39:49,685 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:39:49,686 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:39:49,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:39:49,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:39:49,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:39:49,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:39:49,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:39:49,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:39:49,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:39:49,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:39:49,695 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:39:49,740 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:39:49,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:39:49,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:39:49,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:39:49,746 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:39:49,747 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:39:49,747 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:39:49,747 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:39:49,747 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:39:49,749 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:39:49,750 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:39:49,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:39:49,750 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:39:49,750 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:39:49,751 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:39:49,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:39:49,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:39:49,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:39:49,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:39:49,753 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:39:49,754 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:39:49,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:39:49,755 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:39:49,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:39:49,756 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:39:49,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:39:49,759 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:39:49,760 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:39:49,760 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:39:49,761 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:39:49,763 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31b6f06b720558e9a2e510f7cce25403bea703ef [2020-07-29 01:39:50,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:39:50,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:39:50,088 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:39:50,090 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:39:50,092 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:39:50,092 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca.i [2020-07-29 01:39:50,157 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12dfa6988/be7d57132c1f4e8bad4ef704dfd65b96/FLAG80435a805 [2020-07-29 01:39:50,660 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:39:50,661 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrpbrk_diffterm_alloca.i [2020-07-29 01:39:50,672 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12dfa6988/be7d57132c1f4e8bad4ef704dfd65b96/FLAG80435a805 [2020-07-29 01:39:50,937 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12dfa6988/be7d57132c1f4e8bad4ef704dfd65b96 [2020-07-29 01:39:50,940 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:39:50,942 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:39:50,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:50,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:39:50,947 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:39:50,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:50" (1/1) ... [2020-07-29 01:39:50,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f77e2fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:50, skipping insertion in model container [2020-07-29 01:39:50,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:39:50" (1/1) ... [2020-07-29 01:39:50,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:39:50,992 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:39:51,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:51,509 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:39:51,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:39:51,640 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:39:51,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:51 WrapperNode [2020-07-29 01:39:51,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:39:51,641 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:51,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:39:51,642 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:39:51,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:51" (1/1) ... [2020-07-29 01:39:51,668 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:51" (1/1) ... [2020-07-29 01:39:51,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:39:51,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:39:51,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:39:51,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:39:51,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:51" (1/1) ... [2020-07-29 01:39:51,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:51" (1/1) ... [2020-07-29 01:39:51,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:51" (1/1) ... [2020-07-29 01:39:51,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:51" (1/1) ... [2020-07-29 01:39:51,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:51" (1/1) ... [2020-07-29 01:39:51,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:51" (1/1) ... [2020-07-29 01:39:51,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:51" (1/1) ... [2020-07-29 01:39:51,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:39:51,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:39:51,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:39:51,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:39:51,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:51,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:39:51,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:39:51,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:39:51,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:39:51,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:39:51,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:39:52,242 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:39:52,243 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:39:52,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:52 BoogieIcfgContainer [2020-07-29 01:39:52,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:39:52,248 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:39:52,248 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:39:52,252 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:39:52,253 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:52,253 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:39:50" (1/3) ... [2020-07-29 01:39:52,255 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ee844f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:52, skipping insertion in model container [2020-07-29 01:39:52,255 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:52,255 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:39:51" (2/3) ... [2020-07-29 01:39:52,256 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ee844f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:39:52, skipping insertion in model container [2020-07-29 01:39:52,256 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:39:52,256 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:52" (3/3) ... [2020-07-29 01:39:52,258 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_diffterm_alloca.i [2020-07-29 01:39:52,337 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:39:52,337 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:39:52,337 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:39:52,337 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:39:52,344 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:39:52,345 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:39:52,345 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:39:52,345 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:39:52,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:39:52,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:52,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:52,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:52,397 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:52,397 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:39:52,397 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:39:52,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 01:39:52,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:52,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:52,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:52,402 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:52,402 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:39:52,408 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 12#L382true assume !(main_~length1~0 < 1); 15#L382-2true assume !(main_~length2~0 < 1); 9#L385-1true call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 6#L369-4true [2020-07-29 01:39:52,409 INFO L796 eck$LassoCheckResult]: Loop: 6#L369-4true call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 18#L369-1true assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 20#L372-5true assume !true; 4#L372-6true call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 8#L374true assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 5#L369-3true cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 6#L369-4true [2020-07-29 01:39:52,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:52,415 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-07-29 01:39:52,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:52,425 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595169183] [2020-07-29 01:39:52,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:52,552 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:52,581 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:52,625 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:52,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:52,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1454917130, now seen corresponding path program 1 times [2020-07-29 01:39:52,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:52,629 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8127000] [2020-07-29 01:39:52,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:52,701 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {24#true} is VALID [2020-07-29 01:39:52,702 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {24#true} is VALID [2020-07-29 01:39:52,703 INFO L280 TraceCheckUtils]: 2: Hoare triple {24#true} assume !true; {25#false} is VALID [2020-07-29 01:39:52,703 INFO L280 TraceCheckUtils]: 3: Hoare triple {25#false} call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {25#false} is VALID [2020-07-29 01:39:52,704 INFO L280 TraceCheckUtils]: 4: Hoare triple {25#false} assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; {25#false} is VALID [2020-07-29 01:39:52,704 INFO L280 TraceCheckUtils]: 5: Hoare triple {25#false} cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; {25#false} is VALID [2020-07-29 01:39:52,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:52,707 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8127000] [2020-07-29 01:39:52,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:39:52,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:39:52,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634346487] [2020-07-29 01:39:52,715 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:39:52,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:39:52,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:39:52,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:39:52,734 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2020-07-29 01:39:52,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:52,784 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2020-07-29 01:39:52,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:39:52,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:39:52,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:52,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2020-07-29 01:39:52,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:52,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 13 states and 17 transitions. [2020-07-29 01:39:52,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:39:52,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:39:52,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2020-07-29 01:39:52,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:39:52,818 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:39:52,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2020-07-29 01:39:52,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-29 01:39:52,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:52,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:39:52,854 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:39:52,855 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 13 states. [2020-07-29 01:39:52,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:52,858 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:39:52,858 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:39:52,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:52,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:52,860 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states and 17 transitions. [2020-07-29 01:39:52,860 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states and 17 transitions. [2020-07-29 01:39:52,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:39:52,862 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:39:52,862 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:39:52,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:52,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:52,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:52,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:39:52,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2020-07-29 01:39:52,866 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:39:52,866 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:39:52,867 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:39:52,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:39:52,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:39:52,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:52,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:52,868 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:39:52,868 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:52,869 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 50#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 51#L382 assume !(main_~length1~0 < 1); 52#L382-2 assume !(main_~length2~0 < 1); 49#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 47#L369-4 [2020-07-29 01:39:52,869 INFO L796 eck$LassoCheckResult]: Loop: 47#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 48#L369-1 assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 56#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 53#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 54#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208; 44#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 45#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 46#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 47#L369-4 [2020-07-29 01:39:52,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:52,870 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 2 times [2020-07-29 01:39:52,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:52,870 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764811447] [2020-07-29 01:39:52,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:52,894 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:52,942 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:52,952 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:52,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:52,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1927396657, now seen corresponding path program 1 times [2020-07-29 01:39:52,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:52,956 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577369641] [2020-07-29 01:39:52,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:52,994 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:53,020 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:53,029 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:53,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:53,030 INFO L82 PathProgramCache]: Analyzing trace with hash -102988426, now seen corresponding path program 1 times [2020-07-29 01:39:53,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:53,031 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79766663] [2020-07-29 01:39:53,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:53,106 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:53,174 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:53,192 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:53,400 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-29 01:39:53,892 WARN L193 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2020-07-29 01:39:54,067 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-07-29 01:39:54,085 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:54,086 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:54,087 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:54,087 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:54,087 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:54,087 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:54,087 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:54,088 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:54,088 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_diffterm_alloca.i_Iteration2_Lasso [2020-07-29 01:39:54,088 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:54,088 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:54,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,628 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2020-07-29 01:39:54,853 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2020-07-29 01:39:54,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:54,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:55,997 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2020-07-29 01:39:56,238 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:39:56,245 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:56,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:56,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:56,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:39:56,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:56,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:56,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:56,264 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:39:56,264 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:39:56,268 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:56,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:56,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:56,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:56,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:56,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:56,314 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:56,314 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:56,328 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:56,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 01:39:56,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:56,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:56,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:56,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:56,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:56,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:56,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:56,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:39:56,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:39:56,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:39:56,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:39:56,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:39:56,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:39:56,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:39:56,432 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:39:56,619 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-07-29 01:39:56,620 INFO L444 ModelExtractionUtils]: 16 out of 28 variables were initially zero. Simplification set additionally 9 variables to zero. 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) [2020-07-29 01:39:56,635 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:56,639 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:39:56,640 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:39:56,641 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~sc1~0.offset, v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0.base)_1) = -1*ULTIMATE.start_cstrpbrk_~sc1~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrpbrk_~sc1~0.base)_1 Supporting invariants [] [2020-07-29 01:39:56,724 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2020-07-29 01:39:56,730 INFO L393 LassoCheck]: Loop: "call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);" "assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207;" "call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208;" "assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256);" "assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;" "call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);" "assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212;" "cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset;" [2020-07-29 01:39:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:56,751 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:39:56,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:56,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:39:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:56,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:56,818 INFO L280 TraceCheckUtils]: 0: Hoare triple {92#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {92#unseeded} is VALID [2020-07-29 01:39:56,819 INFO L280 TraceCheckUtils]: 1: Hoare triple {92#unseeded} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {92#unseeded} is VALID [2020-07-29 01:39:56,820 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#unseeded} assume !(main_~length1~0 < 1); {92#unseeded} is VALID [2020-07-29 01:39:56,821 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#unseeded} assume !(main_~length2~0 < 1); {92#unseeded} is VALID [2020-07-29 01:39:56,822 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; {92#unseeded} is VALID [2020-07-29 01:39:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:56,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:39:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:39:56,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:39:56,886 INFO L280 TraceCheckUtils]: 0: Hoare triple {95#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_cstrpbrk_~sc1~0.offset) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)))} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} is VALID [2020-07-29 01:39:56,888 INFO L280 TraceCheckUtils]: 1: Hoare triple {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} is VALID [2020-07-29 01:39:56,889 INFO L280 TraceCheckUtils]: 2: Hoare triple {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} is VALID [2020-07-29 01:39:56,890 INFO L280 TraceCheckUtils]: 3: Hoare triple {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} is VALID [2020-07-29 01:39:56,891 INFO L280 TraceCheckUtils]: 4: Hoare triple {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208; {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} is VALID [2020-07-29 01:39:56,892 INFO L280 TraceCheckUtils]: 5: Hoare triple {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} is VALID [2020-07-29 01:39:56,893 INFO L280 TraceCheckUtils]: 6: Hoare triple {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} is VALID [2020-07-29 01:39:56,895 INFO L280 TraceCheckUtils]: 7: Hoare triple {167#(and (<= (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base)) (<= (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base) (+ ULTIMATE.start_cstrpbrk_~sc1~0.offset oldRank0)))} cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; {150#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_cstrpbrk_~sc1~0.offset) (select |#length| ULTIMATE.start_cstrpbrk_~sc1~0.base))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:39:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:39:56,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:39:56,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:39:56,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:56,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:56,915 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 01:39:56,916 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:39:57,012 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2020-07-29 01:39:57,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:39:57,013 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:57,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 01:39:57,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:57,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:57,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:39:57,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:57,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:57,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:57,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2020-07-29 01:39:57,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:57,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:57,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:57,022 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 01:39:57,025 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:39:57,025 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:39:57,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:39:57,027 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:39:57,027 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:57,028 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:39:57,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:57,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:57,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:57,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:57,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:57,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:57,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:57,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:57,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:57,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:39:57,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:39:57,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:39:57,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:39:57,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:39:57,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:39:57,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:57,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:57,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:39:57,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:39:57,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:39:57,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 8 letters. [2020-07-29 01:39:57,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:57,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:57,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:57,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:57,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:57,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:57,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:57,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:57,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:57,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:39:57,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:39:57,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:39:57,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:39:57,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:39:57,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 8 letters. [2020-07-29 01:39:57,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:39:57,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:39:57,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:39:57,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:57,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:57,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:57,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:57,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:57,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:39:57,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:57,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:57,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:39:57,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:57,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:57,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:39:57,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:57,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:57,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 28 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:39:57,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,049 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:39:57,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:39:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2020-07-29 01:39:57,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:39:57,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 13 letters. Loop has 8 letters. [2020-07-29 01:39:57,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 5 letters. Loop has 16 letters. [2020-07-29 01:39:57,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:39:57,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 01:39:57,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:57,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 18 states and 25 transitions. [2020-07-29 01:39:57,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:39:57,058 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:39:57,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2020-07-29 01:39:57,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:39:57,058 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:39:57,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2020-07-29 01:39:57,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-29 01:39:57,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:39:57,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 25 transitions. Second operand 18 states. [2020-07-29 01:39:57,060 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 25 transitions. Second operand 18 states. [2020-07-29 01:39:57,060 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 18 states. [2020-07-29 01:39:57,061 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:57,064 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-07-29 01:39:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:39:57,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:57,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:57,065 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states and 25 transitions. [2020-07-29 01:39:57,065 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states and 25 transitions. [2020-07-29 01:39:57,066 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:39:57,068 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-07-29 01:39:57,068 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:39:57,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:39:57,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:39:57,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:39:57,069 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:39:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:39:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2020-07-29 01:39:57,070 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:39:57,070 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 01:39:57,071 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:39:57,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2020-07-29 01:39:57,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:39:57,072 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:39:57,072 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:39:57,072 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:39:57,072 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:39:57,072 INFO L794 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 224#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 225#L382 assume !(main_~length1~0 < 1); 226#L382-2 assume !(main_~length2~0 < 1); 223#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 220#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 222#L369-1 assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 232#L372-5 [2020-07-29 01:39:57,073 INFO L796 eck$LassoCheckResult]: Loop: 232#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 227#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 228#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 232#L372-5 [2020-07-29 01:39:57,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:57,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935595, now seen corresponding path program 1 times [2020-07-29 01:39:57,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:57,074 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120231972] [2020-07-29 01:39:57,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:57,088 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:57,117 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:57,125 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:57,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:57,130 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2020-07-29 01:39:57,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:57,131 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360659991] [2020-07-29 01:39:57,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:57,144 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:57,152 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:57,155 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:57,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:39:57,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1593218778, now seen corresponding path program 1 times [2020-07-29 01:39:57,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:39:57,157 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097089243] [2020-07-29 01:39:57,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:39:57,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:57,193 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:39:57,233 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:39:57,238 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:39:57,837 WARN L193 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 99 [2020-07-29 01:39:58,104 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-07-29 01:39:58,107 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:39:58,107 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:39:58,107 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:39:58,107 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:39:58,107 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:39:58,107 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:39:58,107 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:39:58,108 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:39:58,108 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_diffterm_alloca.i_Iteration3_Lasso [2020-07-29 01:39:58,108 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:39:58,108 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:39:58,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:58,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:58,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:58,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:58,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:58,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:58,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:58,540 WARN L193 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2020-07-29 01:39:58,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:58,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:58,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:58,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:58,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:58,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:58,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:58,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:58,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:58,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 01:39:58,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 01:39:58,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 01:39:58,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:58,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:39:59,257 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2020-07-29 01:39:59,789 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2020-07-29 01:40:00,045 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:40:00,045 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:00,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:00,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:00,054 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:00,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:00,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:00,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:00,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:00,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:00,058 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 01:40:00,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:00,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:00,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:00,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:00,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:00,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:00,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:00,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:00,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:00,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:00,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:00,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:00,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:00,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:00,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:00,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:00,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:00,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:00,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:00,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:00,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:00,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:00,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:00,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:00,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:00,171 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:00,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:00,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:00,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:00,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:00,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:00,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:00,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:00,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:00,207 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 01:40:00,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:00,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:00,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:00,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:00,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:00,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:00,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:00,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:00,236 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:00,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:00,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:00,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:00,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:00,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:00,271 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:00,272 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:00,285 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:00,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:00,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:00,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:00,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:00,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:00,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:00,311 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:00,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:00,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:00,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:00,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:00,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:00,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:00,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:00,346 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:00,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:00,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:00,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:00,375 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 01:40:00,375 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2020-07-29 01:40:00,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:00,460 INFO L401 nArgumentSynthesizer]: We have 140 Motzkin's Theorem applications. [2020-07-29 01:40:00,461 INFO L402 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2020-07-29 01:40:00,688 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 01:40:00,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 01:40:00,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:00,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:00,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:00,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:00,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:00,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:00,726 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:00,752 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:00,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:00,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:00,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:00,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:00,769 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:00,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:00,791 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:40:00,815 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-29 01:40:00,815 INFO L444 ModelExtractionUtils]: 37 out of 49 variables were initially zero. Simplification set additionally 9 variables to zero. 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 01:40:00,817 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:40:00,823 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:40:00,824 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:40:00,824 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2, ULTIMATE.start_cstrpbrk_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc216.base)_2 - 1*ULTIMATE.start_cstrpbrk_~s~0.offset Supporting invariants [] [2020-07-29 01:40:00,927 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2020-07-29 01:40:00,931 INFO L393 LassoCheck]: Loop: "call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208;" "assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256);" "assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset;" [2020-07-29 01:40:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:00,937 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:40:00,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:00,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:40:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:00,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:01,018 INFO L280 TraceCheckUtils]: 0: Hoare triple {323#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {323#unseeded} is VALID [2020-07-29 01:40:01,019 INFO L280 TraceCheckUtils]: 1: Hoare triple {323#unseeded} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {323#unseeded} is VALID [2020-07-29 01:40:01,020 INFO L280 TraceCheckUtils]: 2: Hoare triple {323#unseeded} assume !(main_~length1~0 < 1); {323#unseeded} is VALID [2020-07-29 01:40:01,022 INFO L280 TraceCheckUtils]: 3: Hoare triple {323#unseeded} assume !(main_~length2~0 < 1); {323#unseeded} is VALID [2020-07-29 01:40:01,025 INFO L280 TraceCheckUtils]: 4: Hoare triple {323#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; {433#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:01,026 INFO L280 TraceCheckUtils]: 5: Hoare triple {433#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {433#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:01,027 INFO L280 TraceCheckUtils]: 6: Hoare triple {433#(and (= |ULTIMATE.start_main_#t~malloc216.base| ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {412#(and (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|) unseeded)} is VALID [2020-07-29 01:40:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:01,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:40:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:01,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:01,070 INFO L280 TraceCheckUtils]: 0: Hoare triple {413#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset))) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; {440#(and (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} is VALID [2020-07-29 01:40:01,072 INFO L280 TraceCheckUtils]: 1: Hoare triple {440#(and (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {440#(and (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} is VALID [2020-07-29 01:40:01,074 INFO L280 TraceCheckUtils]: 2: Hoare triple {440#(and (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; {415#(and (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc216.base|) (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_cstrpbrk_~s~0.base |ULTIMATE.start_main_#t~malloc216.base|))} is VALID [2020-07-29 01:40:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:40:01,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:40:01,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:40:01,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:01,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,095 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:40:01,095 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-07-29 01:40:01,218 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 43 states and 57 transitions. Complement of second has 6 states. [2020-07-29 01:40:01,219 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 01:40:01,219 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:01,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2020-07-29 01:40:01,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:01,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:01,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:40:01,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:01,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:01,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:01,222 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 57 transitions. [2020-07-29 01:40:01,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:01,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:01,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:01,225 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 25 transitions. cyclomatic complexity: 9 [2020-07-29 01:40:01,226 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:01,226 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:40:01,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:01,228 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:40:01,228 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2020-07-29 01:40:01,229 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:01,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:01,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:01,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:01,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:01,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:01,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:01,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:01,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:01,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:01,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:40:01,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:40:01,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 43 letters. Loop has 43 letters. [2020-07-29 01:40:01,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:40:01,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:40:01,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:40:01,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:01,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:01,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:01,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:01,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:01,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:40:01,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:40:01,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:40:01,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:40:01,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:01,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:01,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:01,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:01,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:01,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:01,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:01,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:01,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:01,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:01,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:01,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:01,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 25 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:01,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:01,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 57 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:01,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,244 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:01,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:40:01,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 01:40:01,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:40:01,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:40:01,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:40:01,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:01,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 57 transitions. cyclomatic complexity: 18 [2020-07-29 01:40:01,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:01,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 30 states and 40 transitions. [2020-07-29 01:40:01,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:40:01,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:40:01,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 40 transitions. [2020-07-29 01:40:01,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:40:01,252 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 40 transitions. [2020-07-29 01:40:01,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 40 transitions. [2020-07-29 01:40:01,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2020-07-29 01:40:01,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:40:01,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states and 40 transitions. Second operand 24 states. [2020-07-29 01:40:01,255 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states and 40 transitions. Second operand 24 states. [2020-07-29 01:40:01,255 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand 24 states. [2020-07-29 01:40:01,255 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:01,258 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2020-07-29 01:40:01,258 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-07-29 01:40:01,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:01,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:01,258 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 30 states and 40 transitions. [2020-07-29 01:40:01,259 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 30 states and 40 transitions. [2020-07-29 01:40:01,259 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:01,262 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2020-07-29 01:40:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-07-29 01:40:01,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:01,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:01,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:40:01,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:40:01,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:40:01,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2020-07-29 01:40:01,264 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-07-29 01:40:01,264 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2020-07-29 01:40:01,264 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:40:01,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2020-07-29 01:40:01,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:01,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:01,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:01,267 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:01,267 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:40:01,267 INFO L794 eck$LassoCheckResult]: Stem: 516#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 509#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 510#L382 assume !(main_~length1~0 < 1); 511#L382-2 assume !(main_~length2~0 < 1); 508#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 504#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 505#L369-1 assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 518#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 514#L372-1 assume !cstrpbrk_#t~short210; 515#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208; 500#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 501#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 502#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 503#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 507#L369-1 assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 517#L372-5 [2020-07-29 01:40:01,267 INFO L796 eck$LassoCheckResult]: Loop: 517#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 512#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 513#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 517#L372-5 [2020-07-29 01:40:01,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:01,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1587378397, now seen corresponding path program 1 times [2020-07-29 01:40:01,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:01,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52533163] [2020-07-29 01:40:01,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:01,364 INFO L280 TraceCheckUtils]: 0: Hoare triple {648#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {648#true} is VALID [2020-07-29 01:40:01,365 INFO L280 TraceCheckUtils]: 1: Hoare triple {648#true} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {648#true} is VALID [2020-07-29 01:40:01,365 INFO L280 TraceCheckUtils]: 2: Hoare triple {648#true} assume !(main_~length1~0 < 1); {648#true} is VALID [2020-07-29 01:40:01,366 INFO L280 TraceCheckUtils]: 3: Hoare triple {648#true} assume !(main_~length2~0 < 1); {648#true} is VALID [2020-07-29 01:40:01,366 INFO L280 TraceCheckUtils]: 4: Hoare triple {648#true} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; {648#true} is VALID [2020-07-29 01:40:01,373 INFO L280 TraceCheckUtils]: 5: Hoare triple {648#true} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {650#(= |ULTIMATE.start_cstrpbrk_#t~mem206| (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~sc1~0.base) ULTIMATE.start_cstrpbrk_~sc1~0.offset))} is VALID [2020-07-29 01:40:01,374 INFO L280 TraceCheckUtils]: 6: Hoare triple {650#(= |ULTIMATE.start_cstrpbrk_#t~mem206| (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~sc1~0.base) ULTIMATE.start_cstrpbrk_~sc1~0.offset))} assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {651#(not (= 49 ULTIMATE.start_cstrpbrk_~c~0))} is VALID [2020-07-29 01:40:01,375 INFO L280 TraceCheckUtils]: 7: Hoare triple {651#(not (= 49 ULTIMATE.start_cstrpbrk_~c~0))} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; {652#(or (not (= ULTIMATE.start_cstrpbrk_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s~0.base) ULTIMATE.start_cstrpbrk_~s~0.offset))) |ULTIMATE.start_cstrpbrk_#t~short210|)} is VALID [2020-07-29 01:40:01,376 INFO L280 TraceCheckUtils]: 8: Hoare triple {652#(or (not (= ULTIMATE.start_cstrpbrk_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s~0.base) ULTIMATE.start_cstrpbrk_~s~0.offset))) |ULTIMATE.start_cstrpbrk_#t~short210|)} assume !cstrpbrk_#t~short210; {653#(not (= ULTIMATE.start_cstrpbrk_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s~0.base) ULTIMATE.start_cstrpbrk_~s~0.offset)))} is VALID [2020-07-29 01:40:01,377 INFO L280 TraceCheckUtils]: 9: Hoare triple {653#(not (= ULTIMATE.start_cstrpbrk_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s~0.base) ULTIMATE.start_cstrpbrk_~s~0.offset)))} assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208; {653#(not (= ULTIMATE.start_cstrpbrk_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s~0.base) ULTIMATE.start_cstrpbrk_~s~0.offset)))} is VALID [2020-07-29 01:40:01,379 INFO L280 TraceCheckUtils]: 10: Hoare triple {653#(not (= ULTIMATE.start_cstrpbrk_~c~0 (select (select |#memory_int| ULTIMATE.start_cstrpbrk_~s~0.base) ULTIMATE.start_cstrpbrk_~s~0.offset)))} call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {654#(not (= |ULTIMATE.start_cstrpbrk_#t~mem212| ULTIMATE.start_cstrpbrk_~c~0))} is VALID [2020-07-29 01:40:01,379 INFO L280 TraceCheckUtils]: 11: Hoare triple {654#(not (= |ULTIMATE.start_cstrpbrk_#t~mem212| ULTIMATE.start_cstrpbrk_~c~0))} assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; {649#false} is VALID [2020-07-29 01:40:01,380 INFO L280 TraceCheckUtils]: 12: Hoare triple {649#false} cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; {649#false} is VALID [2020-07-29 01:40:01,380 INFO L280 TraceCheckUtils]: 13: Hoare triple {649#false} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {649#false} is VALID [2020-07-29 01:40:01,380 INFO L280 TraceCheckUtils]: 14: Hoare triple {649#false} assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {649#false} is VALID [2020-07-29 01:40:01,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:40:01,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52533163] [2020-07-29 01:40:01,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:40:01,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 01:40:01,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858990864] [2020-07-29 01:40:01,382 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:40:01,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:01,383 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2020-07-29 01:40:01,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:01,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820321639] [2020-07-29 01:40:01,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:01,392 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:01,400 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:01,403 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:01,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:40:01,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:40:01,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:40:01,525 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-07-29 01:40:01,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:40:01,776 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-07-29 01:40:01,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:40:01,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:40:01,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:40:01,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2020-07-29 01:40:01,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:40:01,809 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 27 states and 35 transitions. [2020-07-29 01:40:01,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:40:01,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:40:01,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2020-07-29 01:40:01,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:40:01,810 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-07-29 01:40:01,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2020-07-29 01:40:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-07-29 01:40:01,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:40:01,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 35 transitions. Second operand 25 states. [2020-07-29 01:40:01,813 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 35 transitions. Second operand 25 states. [2020-07-29 01:40:01,813 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 25 states. [2020-07-29 01:40:01,813 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:01,815 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2020-07-29 01:40:01,815 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-07-29 01:40:01,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:01,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:01,816 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 27 states and 35 transitions. [2020-07-29 01:40:01,816 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 27 states and 35 transitions. [2020-07-29 01:40:01,817 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:40:01,819 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2020-07-29 01:40:01,819 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-07-29 01:40:01,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:40:01,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:40:01,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:40:01,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:40:01,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 01:40:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2020-07-29 01:40:01,821 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-07-29 01:40:01,821 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-07-29 01:40:01,821 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:40:01,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2020-07-29 01:40:01,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:01,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:01,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:01,823 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:40:01,823 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:40:01,823 INFO L794 eck$LassoCheckResult]: Stem: 707#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 704#L-1 havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; 705#L382 assume !(main_~length1~0 < 1); 706#L382-2 assume !(main_~length2~0 < 1); 703#L385-1 call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; 699#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 700#L369-1 assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 713#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 717#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 716#L372-3 assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208; 695#L372-6 call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); 696#L374 assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; 697#L369-3 cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; 698#L369-4 call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); 702#L369-1 assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; 712#L372-5 [2020-07-29 01:40:01,823 INFO L796 eck$LassoCheckResult]: Loop: 712#L372-5 call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; 708#L372-1 assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); 709#L372-3 assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; 712#L372-5 [2020-07-29 01:40:01,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:01,823 INFO L82 PathProgramCache]: Analyzing trace with hash -187628965, now seen corresponding path program 2 times [2020-07-29 01:40:01,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:01,824 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715656534] [2020-07-29 01:40:01,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:01,840 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:01,856 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:01,861 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:01,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:01,862 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2020-07-29 01:40:01,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:01,863 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876156212] [2020-07-29 01:40:01,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:01,867 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:01,870 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:01,872 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:01,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:01,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1902015318, now seen corresponding path program 1 times [2020-07-29 01:40:01,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:40:01,873 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326733553] [2020-07-29 01:40:01,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:40:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:01,893 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:40:01,944 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:40:01,954 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:40:02,811 WARN L193 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 177 DAG size of output: 137 [2020-07-29 01:40:03,123 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-07-29 01:40:03,126 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:40:03,126 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:40:03,126 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:40:03,127 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:40:03,127 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:40:03,127 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:03,127 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:40:03,127 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:40:03,127 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_diffterm_alloca.i_Iteration5_Lasso [2020-07-29 01:40:03,127 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:40:03,128 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:40:03,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:03,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:03,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:03,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:03,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:03,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:03,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:03,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:03,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:03,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:03,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:04,402 WARN L193 SmtUtils]: Spent 906.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2020-07-29 01:40:04,577 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2020-07-29 01:40:04,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 01:40:04,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:04,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:04,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:04,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:04,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:04,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:04,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:04,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:40:05,111 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2020-07-29 01:40:06,018 WARN L193 SmtUtils]: Spent 526.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2020-07-29 01:40:06,276 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 38 [2020-07-29 01:40:06,627 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:40:06,628 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:06,632 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:06,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:06,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:06,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:06,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:06,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:06,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:06,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:06,636 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:06,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:06,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:06,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:06,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:06,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:06,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:06,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:06,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:06,663 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) [2020-07-29 01:40:06,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:06,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:06,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:06,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:06,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:06,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:06,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:06,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:06,724 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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 01:40:06,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:06,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:06,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:06,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:06,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:06,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:06,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:06,753 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 01:40:06,754 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 01:40:06,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:06,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:06,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:06,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:06,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:06,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:06,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:06,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:06,780 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 01:40:06,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:06,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:06,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:06,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:06,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:06,807 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:06,807 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:06,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 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 01:40:06,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:06,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:06,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:06,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:06,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:06,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:06,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:06,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:06,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:40:06,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:06,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:06,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:06,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:06,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:06,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:06,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:06,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:06,863 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:06,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:06,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:06,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:40:06,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:06,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:06,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:06,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:40:06,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:40:06,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:06,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:06,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:06,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:06,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:06,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:06,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:06,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:06,916 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 01:40:06,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:06,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:06,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:06,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:06,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:06,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:06,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:06,951 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 01:40:06,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:06,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:06,977 INFO L203 nArgumentSynthesizer]: 6 stem disjuncts [2020-07-29 01:40:06,977 INFO L204 nArgumentSynthesizer]: 7 loop disjuncts [2020-07-29 01:40:06,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,096 INFO L401 nArgumentSynthesizer]: We have 196 Motzkin's Theorem applications. [2020-07-29 01:40:07,096 INFO L402 nArgumentSynthesizer]: A total of 14 supporting invariants were added. [2020-07-29 01:40:07,510 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) [2020-07-29 01:40:07,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:07,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:07,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:07,559 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) [2020-07-29 01:40:07,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:07,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,603 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:07,603 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:07,607 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 01:40:07,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:07,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,639 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 01:40:07,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:07,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:07,670 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 01:40:07,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:07,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:07,699 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:07,705 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 01:40:07,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:40:07,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:40:07,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:40:07,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:40:07,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:40:07,751 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:40:07,751 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:40:07,772 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:40:07,849 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2020-07-29 01:40:07,850 INFO L444 ModelExtractionUtils]: 9 out of 46 variables were initially zero. Simplification set additionally 32 variables to zero. 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) [2020-07-29 01:40:07,853 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:40:07,857 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:40:07,858 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:40:07,858 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0.offset, ULTIMATE.start_main_~length2~0) = -1*ULTIMATE.start_cstrpbrk_~s~0.offset + 1*ULTIMATE.start_main_~length2~0 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 + 1*ULTIMATE.start_main_~length2~0 >= 0] [2020-07-29 01:40:08,106 INFO L297 tatePredicateManager]: 29 out of 32 supporting invariants were superfluous and have been removed [2020-07-29 01:40:08,119 INFO L393 LassoCheck]: Loop: "call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208;" "assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256);" "assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset;" [2020-07-29 01:40:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:40:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:08,254 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:40:08,255 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 25 [2020-07-29 01:40:08,256 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:40:08,278 INFO L624 ElimStorePlain]: treesize reduction 10, result has 65.5 percent of original size [2020-07-29 01:40:08,280 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:40:08,281 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2020-07-29 01:40:08,284 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:40:08,284 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_91|, |ULTIMATE.start_main_#t~malloc215.base|, ULTIMATE.start_main_~length1~0]. (and (= (store (store |v_#length_91| |ULTIMATE.start_main_#t~malloc215.base| ULTIMATE.start_main_~length1~0) ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_main_~length2~0) |#length|) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) unseeded) [2020-07-29 01:40:08,284 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded) [2020-07-29 01:40:08,321 INFO L280 TraceCheckUtils]: 0: Hoare triple {843#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {843#unseeded} is VALID [2020-07-29 01:40:08,322 INFO L280 TraceCheckUtils]: 1: Hoare triple {843#unseeded} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {843#unseeded} is VALID [2020-07-29 01:40:08,323 INFO L280 TraceCheckUtils]: 2: Hoare triple {843#unseeded} assume !(main_~length1~0 < 1); {843#unseeded} is VALID [2020-07-29 01:40:08,323 INFO L280 TraceCheckUtils]: 3: Hoare triple {843#unseeded} assume !(main_~length2~0 < 1); {843#unseeded} is VALID [2020-07-29 01:40:08,326 INFO L280 TraceCheckUtils]: 4: Hoare triple {843#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; {1040#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:08,327 INFO L280 TraceCheckUtils]: 5: Hoare triple {1040#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {1040#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:08,328 INFO L280 TraceCheckUtils]: 6: Hoare triple {1040#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {1040#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:08,329 INFO L280 TraceCheckUtils]: 7: Hoare triple {1040#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; {1040#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:08,330 INFO L280 TraceCheckUtils]: 8: Hoare triple {1040#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {1040#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:08,331 INFO L280 TraceCheckUtils]: 9: Hoare triple {1040#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208; {1040#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:08,332 INFO L280 TraceCheckUtils]: 10: Hoare triple {1040#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {1040#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:08,333 INFO L280 TraceCheckUtils]: 11: Hoare triple {1040#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; {1040#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:08,334 INFO L280 TraceCheckUtils]: 12: Hoare triple {1040#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; {1040#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:08,335 INFO L280 TraceCheckUtils]: 13: Hoare triple {1040#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {1040#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:08,337 INFO L280 TraceCheckUtils]: 14: Hoare triple {1040#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {1019#(and (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) (>= (+ (* (- 1) (select |#length| ULTIMATE.start_main_~nondetString2~0.base)) ULTIMATE.start_main_~length2~0) 0) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:40:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:08,388 INFO L280 TraceCheckUtils]: 0: Hoare triple {1020#(and (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) (>= (+ (* (- 1) (select |#length| ULTIMATE.start_main_~nondetString2~0.base)) ULTIMATE.start_main_~length2~0) 0) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset) ULTIMATE.start_main_~length2~0)))} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; {1071#(and (<= ULTIMATE.start_main_~length2~0 (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} is VALID [2020-07-29 01:40:08,390 INFO L280 TraceCheckUtils]: 1: Hoare triple {1071#(and (<= ULTIMATE.start_main_~length2~0 (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {1071#(and (<= ULTIMATE.start_main_~length2~0 (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} is VALID [2020-07-29 01:40:08,391 INFO L280 TraceCheckUtils]: 2: Hoare triple {1071#(and (<= ULTIMATE.start_main_~length2~0 (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; {1022#(and (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) (>= (+ (* (- 1) (select |#length| ULTIMATE.start_main_~nondetString2~0.base)) ULTIMATE.start_main_~length2~0) 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset) ULTIMATE.start_main_~length2~0))) unseeded) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:40:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:40:08,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:40:08,416 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 01:40:08,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,417 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:40:08,417 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:40:08,529 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2020-07-29 01:40:08,529 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 01:40:08,530 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:08,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:08,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:08,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:08,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:40:08,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:08,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:08,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:08,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2020-07-29 01:40:08,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:08,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:08,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:08,536 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:08,539 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:08,539 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:40:08,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:08,541 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:40:08,541 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 51 transitions. cyclomatic complexity: 13 [2020-07-29 01:40:08,542 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:08,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:40:08,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:40:08,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:40:08,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:40:08,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:40:08,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:40:08,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:08,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:08,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:08,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:08,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:08,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:08,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:08,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:08,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:08,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:08,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:08,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:08,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:08,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:08,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:08,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,554 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:08,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:40:08,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 01:40:08,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,556 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:40:08,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:40:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:08,647 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:40:08,648 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 25 [2020-07-29 01:40:08,648 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:40:08,671 INFO L624 ElimStorePlain]: treesize reduction 10, result has 65.5 percent of original size [2020-07-29 01:40:08,674 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:40:08,674 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2020-07-29 01:40:08,677 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:40:08,677 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_92|, |ULTIMATE.start_main_#t~malloc215.base|, ULTIMATE.start_main_~length1~0]. (and (= (store (store |v_#length_92| |ULTIMATE.start_main_#t~malloc215.base| ULTIMATE.start_main_~length1~0) ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_main_~length2~0) |#length|) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) unseeded) [2020-07-29 01:40:08,678 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded) [2020-07-29 01:40:08,716 INFO L280 TraceCheckUtils]: 0: Hoare triple {843#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {843#unseeded} is VALID [2020-07-29 01:40:08,716 INFO L280 TraceCheckUtils]: 1: Hoare triple {843#unseeded} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {843#unseeded} is VALID [2020-07-29 01:40:08,717 INFO L280 TraceCheckUtils]: 2: Hoare triple {843#unseeded} assume !(main_~length1~0 < 1); {843#unseeded} is VALID [2020-07-29 01:40:08,718 INFO L280 TraceCheckUtils]: 3: Hoare triple {843#unseeded} assume !(main_~length2~0 < 1); {843#unseeded} is VALID [2020-07-29 01:40:08,720 INFO L280 TraceCheckUtils]: 4: Hoare triple {843#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; {1146#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:08,721 INFO L280 TraceCheckUtils]: 5: Hoare triple {1146#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {1146#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:08,721 INFO L280 TraceCheckUtils]: 6: Hoare triple {1146#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {1146#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:08,723 INFO L280 TraceCheckUtils]: 7: Hoare triple {1146#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; {1146#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:08,723 INFO L280 TraceCheckUtils]: 8: Hoare triple {1146#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {1146#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:08,724 INFO L280 TraceCheckUtils]: 9: Hoare triple {1146#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208; {1146#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:08,726 INFO L280 TraceCheckUtils]: 10: Hoare triple {1146#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {1146#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:08,726 INFO L280 TraceCheckUtils]: 11: Hoare triple {1146#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; {1146#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:08,727 INFO L280 TraceCheckUtils]: 12: Hoare triple {1146#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; {1146#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:08,727 INFO L280 TraceCheckUtils]: 13: Hoare triple {1146#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {1146#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:08,728 INFO L280 TraceCheckUtils]: 14: Hoare triple {1146#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {1019#(and (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) (>= (+ (* (- 1) (select |#length| ULTIMATE.start_main_~nondetString2~0.base)) ULTIMATE.start_main_~length2~0) 0) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:08,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:40:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:08,785 INFO L280 TraceCheckUtils]: 0: Hoare triple {1020#(and (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) (>= (+ (* (- 1) (select |#length| ULTIMATE.start_main_~nondetString2~0.base)) ULTIMATE.start_main_~length2~0) 0) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset) ULTIMATE.start_main_~length2~0)))} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; {1177#(and (<= ULTIMATE.start_main_~length2~0 (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} is VALID [2020-07-29 01:40:08,787 INFO L280 TraceCheckUtils]: 1: Hoare triple {1177#(and (<= ULTIMATE.start_main_~length2~0 (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {1177#(and (<= ULTIMATE.start_main_~length2~0 (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} is VALID [2020-07-29 01:40:08,793 INFO L280 TraceCheckUtils]: 2: Hoare triple {1177#(and (<= ULTIMATE.start_main_~length2~0 (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; {1022#(and (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) (>= (+ (* (- 1) (select |#length| ULTIMATE.start_main_~nondetString2~0.base)) ULTIMATE.start_main_~length2~0) 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset) ULTIMATE.start_main_~length2~0))) unseeded) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:40:08,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:40:08,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:40:08,817 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 01:40:08,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,818 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:40:08,818 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:40:08,916 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2020-07-29 01:40:08,917 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 01:40:08,917 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:08,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:08,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:08,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:08,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:40:08,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:08,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:08,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:08,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 51 transitions. [2020-07-29 01:40:08,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:40:08,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:08,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:08,920 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:08,920 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:08,920 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:40:08,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:08,922 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:40:08,922 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 51 transitions. cyclomatic complexity: 13 [2020-07-29 01:40:08,923 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:08,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:40:08,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:40:08,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:40:08,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:40:08,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:40:08,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:40:08,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:08,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:08,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:08,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:08,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:08,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:08,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:08,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:08,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:08,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:08,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:08,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:08,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:08,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:08,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:08,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 51 transitions. cyclomatic complexity: 13 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:08,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,933 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:08,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:40:08,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2020-07-29 01:40:08,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:08,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:08,934 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:40:08,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:40:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:40:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:08,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:09,025 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:40:09,026 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 25 [2020-07-29 01:40:09,027 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:40:09,050 INFO L624 ElimStorePlain]: treesize reduction 10, result has 65.5 percent of original size [2020-07-29 01:40:09,052 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:40:09,052 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2020-07-29 01:40:09,055 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:40:09,055 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_93|, |ULTIMATE.start_main_#t~malloc215.base|, ULTIMATE.start_main_~length1~0]. (and (= |#length| (store (store |v_#length_93| |ULTIMATE.start_main_#t~malloc215.base| ULTIMATE.start_main_~length1~0) ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_main_~length2~0)) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) unseeded) [2020-07-29 01:40:09,055 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded) [2020-07-29 01:40:09,097 INFO L280 TraceCheckUtils]: 0: Hoare triple {843#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {843#unseeded} is VALID [2020-07-29 01:40:09,098 INFO L280 TraceCheckUtils]: 1: Hoare triple {843#unseeded} havoc main_#res;havoc main_#t~nondet213, main_#t~nondet214, main_#t~malloc215.base, main_#t~malloc215.offset, main_#t~malloc216.base, main_#t~malloc216.offset, main_#t~ret217.base, main_#t~ret217.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~nondet213;havoc main_#t~nondet213;main_~length2~0 := main_#t~nondet214;havoc main_#t~nondet214; {843#unseeded} is VALID [2020-07-29 01:40:09,098 INFO L280 TraceCheckUtils]: 2: Hoare triple {843#unseeded} assume !(main_~length1~0 < 1); {843#unseeded} is VALID [2020-07-29 01:40:09,099 INFO L280 TraceCheckUtils]: 3: Hoare triple {843#unseeded} assume !(main_~length2~0 < 1); {843#unseeded} is VALID [2020-07-29 01:40:09,101 INFO L280 TraceCheckUtils]: 4: Hoare triple {843#unseeded} call main_#t~malloc215.base, main_#t~malloc215.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc215.base, main_#t~malloc215.offset;call main_#t~malloc216.base, main_#t~malloc216.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc216.base, main_#t~malloc216.offset;call write~int(49, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(49, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset, cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrpbrk_#res.base, cstrpbrk_#res.offset;havoc cstrpbrk_#t~mem207, cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset, cstrpbrk_#t~mem208, cstrpbrk_#t~mem209, cstrpbrk_#t~short210, cstrpbrk_#t~mem212, cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset, cstrpbrk_#t~mem206, cstrpbrk_~s1.base, cstrpbrk_~s1.offset, cstrpbrk_~s2.base, cstrpbrk_~s2.offset, cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, cstrpbrk_~c~0;cstrpbrk_~s1.base, cstrpbrk_~s1.offset := cstrpbrk_#in~s1.base, cstrpbrk_#in~s1.offset;cstrpbrk_~s2.base, cstrpbrk_~s2.offset := cstrpbrk_#in~s2.base, cstrpbrk_#in~s2.offset;havoc cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;havoc cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;havoc cstrpbrk_~c~0;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_~s1.base, cstrpbrk_~s1.offset; {1252#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:09,102 INFO L280 TraceCheckUtils]: 5: Hoare triple {1252#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {1252#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:09,103 INFO L280 TraceCheckUtils]: 6: Hoare triple {1252#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {1252#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:09,105 INFO L280 TraceCheckUtils]: 7: Hoare triple {1252#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; {1252#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:09,106 INFO L280 TraceCheckUtils]: 8: Hoare triple {1252#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {1252#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:09,106 INFO L280 TraceCheckUtils]: 9: Hoare triple {1252#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} assume !cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208; {1252#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:09,107 INFO L280 TraceCheckUtils]: 10: Hoare triple {1252#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} call cstrpbrk_#t~mem212 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1); {1252#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:09,114 INFO L280 TraceCheckUtils]: 11: Hoare triple {1252#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} assume !(cstrpbrk_#t~mem212 != cstrpbrk_~c~0);havoc cstrpbrk_#t~mem212; {1252#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:09,115 INFO L280 TraceCheckUtils]: 12: Hoare triple {1252#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset := cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset;cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset := cstrpbrk_#t~post205.base, 1 + cstrpbrk_#t~post205.offset;havoc cstrpbrk_#t~post205.base, cstrpbrk_#t~post205.offset; {1252#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:09,116 INFO L280 TraceCheckUtils]: 13: Hoare triple {1252#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} call cstrpbrk_#t~mem206 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1); {1252#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 01:40:09,119 INFO L280 TraceCheckUtils]: 14: Hoare triple {1252#(and (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} assume !!(49 != cstrpbrk_#t~mem206);havoc cstrpbrk_#t~mem206;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_~s2.base, cstrpbrk_~s2.offset;call cstrpbrk_#t~mem207 := read~int(cstrpbrk_~sc1~0.base, cstrpbrk_~sc1~0.offset, 1);cstrpbrk_~c~0 := cstrpbrk_#t~mem207;havoc cstrpbrk_#t~mem207; {1019#(and (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) (>= (+ (* (- 1) (select |#length| ULTIMATE.start_main_~nondetString2~0.base)) ULTIMATE.start_main_~length2~0) 0) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) unseeded)} is VALID [2020-07-29 01:40:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:09,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 01:40:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:40:09,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:40:09,174 INFO L280 TraceCheckUtils]: 0: Hoare triple {1020#(and (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) (>= (+ (* (- 1) (select |#length| ULTIMATE.start_main_~nondetString2~0.base)) ULTIMATE.start_main_~length2~0) 0) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset) ULTIMATE.start_main_~length2~0)))} call cstrpbrk_#t~mem208 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := 49 != cstrpbrk_#t~mem208; {1283#(and (<= ULTIMATE.start_main_~length2~0 (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} is VALID [2020-07-29 01:40:09,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {1283#(and (<= ULTIMATE.start_main_~length2~0 (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} assume cstrpbrk_#t~short210;call cstrpbrk_#t~mem209 := read~int(cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset, 1);cstrpbrk_#t~short210 := cstrpbrk_#t~mem209 != (if cstrpbrk_~c~0 % 256 <= 127 then cstrpbrk_~c~0 % 256 else cstrpbrk_~c~0 % 256 - 256); {1283#(and (<= ULTIMATE.start_main_~length2~0 (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} is VALID [2020-07-29 01:40:09,177 INFO L280 TraceCheckUtils]: 2: Hoare triple {1283#(and (<= ULTIMATE.start_main_~length2~0 (+ ULTIMATE.start_cstrpbrk_~s~0.offset oldRank0)) (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base) (<= (+ ULTIMATE.start_cstrpbrk_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrpbrk_~s~0.base)))} assume !!cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem209;havoc cstrpbrk_#t~short210;havoc cstrpbrk_#t~mem208;cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset := cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset;cstrpbrk_~s~0.base, cstrpbrk_~s~0.offset := cstrpbrk_#t~post211.base, 1 + cstrpbrk_#t~post211.offset;havoc cstrpbrk_#t~post211.base, cstrpbrk_#t~post211.offset; {1022#(and (= ULTIMATE.start_cstrpbrk_~s~0.base ULTIMATE.start_cstrpbrk_~s2.base) (>= (+ (* (- 1) (select |#length| ULTIMATE.start_main_~nondetString2~0.base)) ULTIMATE.start_main_~length2~0) 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_cstrpbrk_~s~0.offset) ULTIMATE.start_main_~length2~0))) unseeded) (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_cstrpbrk_~s2.base))} is VALID [2020-07-29 01:40:09,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:40:09,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:40:09,205 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 01:40:09,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,205 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:40:09,206 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:40:09,342 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 33 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 41 states and 53 transitions. Complement of second has 5 states. [2020-07-29 01:40:09,342 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 01:40:09,342 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:09,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:09,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:09,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:09,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:40:09,344 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:09,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:40:09,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:40:09,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. [2020-07-29 01:40:09,345 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:40:09,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:40:09,346 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 11 [2020-07-29 01:40:09,346 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:40:09,346 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:40:09,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:40:09,348 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:40:09,348 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2020-07-29 01:40:09,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2020-07-29 01:40:09,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:40:09,348 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:40:09,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:09,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:09,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:09,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:40:09,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:40:09,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 41 letters. Loop has 41 letters. [2020-07-29 01:40:09,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:40:09,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:40:09,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:40:09,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:09,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:09,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:40:09,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:09,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:09,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:40:09,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:09,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:09,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 3 letters. [2020-07-29 01:40:09,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:09,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:09,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 53 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:40:09,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,360 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:40:09,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:40:09,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2020-07-29 01:40:09,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:40:09,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:40:09,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 15 letters. Loop has 6 letters. [2020-07-29 01:40:09,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:40:09,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. cyclomatic complexity: 15 [2020-07-29 01:40:09,365 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:40:09,365 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2020-07-29 01:40:09,365 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:40:09,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:40:09,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:40:09,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:40:09,366 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:40:09,366 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:40:09,366 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:40:09,366 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:40:09,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:40:09,367 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:40:09,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:40:09,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:40:09 BoogieIcfgContainer [2020-07-29 01:40:09,374 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:40:09,374 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:40:09,374 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:40:09,374 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:40:09,375 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:39:52" (3/4) ... [2020-07-29 01:40:09,379 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:40:09,379 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:40:09,381 INFO L168 Benchmark]: Toolchain (without parser) took 18440.16 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 399.5 MB). Free memory was 952.2 MB in the beginning and 939.7 MB in the end (delta: 12.5 MB). Peak memory consumption was 412.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:09,382 INFO L168 Benchmark]: CDTParser took 0.28 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 01:40:09,383 INFO L168 Benchmark]: CACSL2BoogieTranslator took 697.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:09,383 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.70 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:40:09,384 INFO L168 Benchmark]: Boogie Preprocessor took 33.17 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:09,384 INFO L168 Benchmark]: RCFGBuilder took 514.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:09,385 INFO L168 Benchmark]: BuchiAutomizer took 17126.02 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 262.1 MB). Free memory was 1.1 GB in the beginning and 939.7 MB in the end (delta: 141.0 MB). Peak memory consumption was 403.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:40:09,385 INFO L168 Benchmark]: Witness Printer took 5.46 ms. Allocated memory is still 1.4 GB. Free memory is still 939.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:40:09,389 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.28 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 697.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -164.9 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.70 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 33.17 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 514.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17126.02 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 262.1 MB). Free memory was 1.1 GB in the beginning and 939.7 MB in the end (delta: 141.0 MB). Peak memory consumption was 403.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.46 ms. Allocated memory is still 1.4 GB. Free memory is still 939.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * sc1 + unknown-#length-unknown[sc1] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length2 * sizeof(char))] + -1 * s and consists of 4 locations. One nondeterministic module has affine ranking function -1 * s + length2 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.0s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 14.6s. Construction of modules took 0.2s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 25 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 99 SDtfs, 112 SDslu, 66 SDs, 0 SdLazy, 116 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital269 mio100 ax100 hnf99 lsp106 ukn81 mio100 lsp33 div130 bol100 ite100 ukn100 eq166 hnf78 smp88 dnf719 smp32 tf100 neg95 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 537ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 6 DisjunctsLoop: 7 SupportingInvariants: 14 MotzkinApplications: 196 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...