./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 46421108dc6473f7bf7bcbb7826a3247c1ccc8d1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 03:26:26,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:26:26,091 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:26:26,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:26:26,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:26:26,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:26:26,107 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:26:26,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:26:26,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:26:26,111 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:26:26,113 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:26:26,114 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:26:26,114 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:26:26,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:26:26,116 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:26:26,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:26:26,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:26:26,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:26:26,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:26:26,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:26:26,125 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:26:26,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:26:26,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:26:26,128 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:26:26,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:26:26,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:26:26,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:26:26,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:26:26,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:26:26,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:26:26,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:26:26,135 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:26:26,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:26:26,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:26:26,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:26:26,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:26:26,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:26:26,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:26:26,140 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:26:26,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:26:26,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:26:26,142 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:26:26,158 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:26:26,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:26:26,160 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:26:26,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:26:26,161 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:26:26,161 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:26:26,161 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:26:26,162 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:26:26,162 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:26:26,162 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:26:26,162 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:26:26,163 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:26:26,163 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:26:26,163 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:26:26,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:26:26,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:26:26,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:26:26,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:26:26,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:26:26,165 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:26:26,165 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:26:26,165 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:26:26,166 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:26:26,166 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:26:26,166 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:26:26,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:26:26,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:26:26,167 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:26:26,167 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:26:26,168 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:26:26,168 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:26:26,168 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:26:26,169 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:26:26,170 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 46421108dc6473f7bf7bcbb7826a3247c1ccc8d1 [2020-07-29 03:26:26,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:26:26,525 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:26:26,529 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:26:26,530 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:26:26,530 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:26:26,531 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i [2020-07-29 03:26:26,590 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56ce067ed/fe67d4415de54983928773f394c02e7c/FLAGe52abf64f [2020-07-29 03:26:27,102 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:26:27,103 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrspn-alloca-2.i [2020-07-29 03:26:27,119 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56ce067ed/fe67d4415de54983928773f394c02e7c/FLAGe52abf64f [2020-07-29 03:26:27,437 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56ce067ed/fe67d4415de54983928773f394c02e7c [2020-07-29 03:26:27,442 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:26:27,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:26:27,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:26:27,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:26:27,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:26:27,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:26:27" (1/1) ... [2020-07-29 03:26:27,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b98b30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:27, skipping insertion in model container [2020-07-29 03:26:27,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:26:27" (1/1) ... [2020-07-29 03:26:27,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:26:27,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:26:27,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:26:27,897 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:26:27,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:26:28,023 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:26:28,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:28 WrapperNode [2020-07-29 03:26:28,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:26:28,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:26:28,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:26:28,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:26:28,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:28" (1/1) ... [2020-07-29 03:26:28,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:28" (1/1) ... [2020-07-29 03:26:28,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:26:28,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:26:28,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:26:28,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:26:28,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:28" (1/1) ... [2020-07-29 03:26:28,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:28" (1/1) ... [2020-07-29 03:26:28,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:28" (1/1) ... [2020-07-29 03:26:28,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:28" (1/1) ... [2020-07-29 03:26:28,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:28" (1/1) ... [2020-07-29 03:26:28,111 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:28" (1/1) ... [2020-07-29 03:26:28,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:28" (1/1) ... [2020-07-29 03:26:28,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:26:28,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:26:28,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:26:28,117 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:26:28,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:28,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:26:28,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:26:28,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:26:28,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:26:28,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:26:28,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:26:28,666 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:26:28,666 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-29 03:26:28,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:28 BoogieIcfgContainer [2020-07-29 03:26:28,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:26:28,670 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:26:28,671 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:26:28,674 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:26:28,675 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:28,676 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:26:27" (1/3) ... [2020-07-29 03:26:28,677 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6983e047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:26:28, skipping insertion in model container [2020-07-29 03:26:28,677 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:28,677 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:26:28" (2/3) ... [2020-07-29 03:26:28,678 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6983e047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:26:28, skipping insertion in model container [2020-07-29 03:26:28,678 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:26:28,678 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:28" (3/3) ... [2020-07-29 03:26:28,680 INFO L371 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrspn-alloca-2.i [2020-07-29 03:26:28,729 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:26:28,730 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:26:28,730 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:26:28,730 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:26:28,730 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:26:28,731 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:26:28,731 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:26:28,731 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:26:28,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-07-29 03:26:28,775 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-07-29 03:26:28,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:28,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:28,783 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:26:28,783 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:28,783 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:26:28,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-07-29 03:26:28,787 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-07-29 03:26:28,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:28,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:28,788 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 03:26:28,789 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:28,797 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 19#L528true assume !(main_~length1~0 < 1); 5#L528-2true assume !(main_~length2~0 < 1); 15#L531-1true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 8#L537-3true [2020-07-29 03:26:28,797 INFO L796 eck$LassoCheckResult]: Loop: 8#L537-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 7#L537-2true main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 8#L537-3true [2020-07-29 03:26:28,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:28,804 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2020-07-29 03:26:28,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:28,814 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115725045] [2020-07-29 03:26:28,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:28,917 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:28,940 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:28,982 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:28,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:28,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1699, now seen corresponding path program 1 times [2020-07-29 03:26:28,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:28,988 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478184035] [2020-07-29 03:26:28,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:29,029 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:29,045 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:29,052 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:29,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:29,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935720, now seen corresponding path program 1 times [2020-07-29 03:26:29,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:29,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112849938] [2020-07-29 03:26:29,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:29,119 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:29,153 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:29,158 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:29,394 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2020-07-29 03:26:29,515 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:29,516 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:29,516 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:29,517 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:29,517 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:29,517 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:29,517 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:29,518 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:29,518 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca-2.i_Iteration1_Lasso [2020-07-29 03:26:29,518 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:29,519 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:29,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:29,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:29,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:29,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:29,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:29,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:29,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:29,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:29,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:29,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:29,816 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2020-07-29 03:26:29,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:29,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:29,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:29,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:29,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:30,522 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:30,527 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 03:26:30,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:30,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:30,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:30,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:30,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:30,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:30,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:30,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:26:30,589 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:30,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:30,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:30,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:30,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:30,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:30,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:30,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:30,594 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 03:26:30,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 03:26:30,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:30,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:30,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:30,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:30,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:30,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:30,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:30,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:30,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:30,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:30,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:30,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:30,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:30,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:30,671 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:30,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:30,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:30,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:30,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:30,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:30,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:30,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:30,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:30,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:30,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:30,708 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:30,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:30,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:30,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:30,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:30,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:30,744 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:30,745 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:30,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:30,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:30,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:30,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:30,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:30,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:30,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:30,780 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:30,784 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:30,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:30,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:30,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:30,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:30,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:30,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:30,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:30,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:30,825 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:30,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:30,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:30,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:30,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:30,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:30,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:30,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:30,869 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:30,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:30,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:30,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:30,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:30,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:30,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:30,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:30,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:30,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:30,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:30,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:30,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:30,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:30,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:30,959 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:30,960 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:30,967 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:30,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:31,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:31,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:31,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:31,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:31,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:31,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:31,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:31,003 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 03:26:31,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:31,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:31,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:31,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:31,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:31,036 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:31,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:31,043 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) [2020-07-29 03:26:31,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:31,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:31,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:31,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:31,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:31,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:31,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:31,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:31,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:31,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:31,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:31,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:31,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:31,146 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:31,146 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:31,153 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:31,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:31,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:31,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:31,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:31,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:31,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:31,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:31,241 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:31,336 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 03:26:31,337 INFO L444 ModelExtractionUtils]: 9 out of 22 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:31,343 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:31,351 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:31,352 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:31,352 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1) = -1*ULTIMATE.start_main_~nondetString1~0.offset - 1*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 Supporting invariants [] [2020-07-29 03:26:31,410 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:26:31,422 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11;" "main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10;" [2020-07-29 03:26:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:31,437 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:26:31,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:31,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:26:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:31,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:31,505 INFO L280 TraceCheckUtils]: 0: Hoare triple {30#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {30#unseeded} is VALID [2020-07-29 03:26:31,506 INFO L280 TraceCheckUtils]: 1: Hoare triple {30#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; {30#unseeded} is VALID [2020-07-29 03:26:31,506 INFO L280 TraceCheckUtils]: 2: Hoare triple {30#unseeded} assume !(main_~length1~0 < 1); {30#unseeded} is VALID [2020-07-29 03:26:31,507 INFO L280 TraceCheckUtils]: 3: Hoare triple {30#unseeded} assume !(main_~length2~0 < 1); {30#unseeded} is VALID [2020-07-29 03:26:31,508 INFO L280 TraceCheckUtils]: 4: Hoare triple {30#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; {74#(and unseeded (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} is VALID [2020-07-29 03:26:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:31,516 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:26:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:31,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:31,550 INFO L280 TraceCheckUtils]: 0: Hoare triple {75#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~nondetString1~0.offset) (* (- 1) ULTIMATE.start_main_~i~0) (select |#length| |ULTIMATE.start_main_#t~malloc8.base|))) (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; {95#(and (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~i~0 1) (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) (+ ULTIMATE.start_main_~nondetString1~0.offset oldRank0 ULTIMATE.start_main_~i~0)) (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} is VALID [2020-07-29 03:26:31,552 INFO L280 TraceCheckUtils]: 1: Hoare triple {95#(and (<= (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~i~0 1) (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) (+ ULTIMATE.start_main_~nondetString1~0.offset oldRank0 ULTIMATE.start_main_~i~0)) (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {77#(and (or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~nondetString1~0.offset) (* (- 1) ULTIMATE.start_main_~i~0) (select |#length| |ULTIMATE.start_main_#t~malloc8.base|))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} is VALID [2020-07-29 03:26:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:31,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:31,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:31,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:31,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,588 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:26:31,590 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states. Second operand 3 states. [2020-07-29 03:26:31,769 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states.. Second operand 3 states. Result 45 states and 64 transitions. Complement of second has 8 states. [2020-07-29 03:26:31,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:31,769 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:31,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-07-29 03:26:31,773 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-07-29 03:26:31,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:31,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:31,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:26:31,780 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:26:31,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:31,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:31,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 64 transitions. [2020-07-29 03:26:31,782 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:26:31,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:31,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:31,785 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states. [2020-07-29 03:26:31,788 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2020-07-29 03:26:31,790 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 03:26:31,790 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:26:31,793 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:26:31,794 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:26:31,794 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 64 transitions. cyclomatic complexity: 26 [2020-07-29 03:26:31,796 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:26:31,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:31,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:31,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:31,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:31,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:31,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:31,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:31,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:31,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:31,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 03:26:31,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 03:26:31,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 45 letters. Loop has 45 letters. [2020-07-29 03:26:31,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:26:31,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:26:31,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:26:31,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:31,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:31,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:31,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:31,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:31,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:31,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:31,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:31,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:31,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:31,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:31,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:31,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:31,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:31,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:31,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:31,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:31,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:31,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:31,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:31,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:31,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:26:31,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:26:31,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:26:31,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:31,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:31,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:31,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:31,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:31,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:31,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:31,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:31,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:26:31,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:31,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:31,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:31,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:31,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:31,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:31,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:31,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:31,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:31,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:31,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:31,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:31,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:31,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:31,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:31,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:31,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:31,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 64 transitions. cyclomatic complexity: 26 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:31,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,829 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:31,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:26:31,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2020-07-29 03:26:31,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:26:31,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:31,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 42 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 03:26:31,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:31,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 64 transitions. cyclomatic complexity: 26 [2020-07-29 03:26:31,842 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:26:31,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 16 states and 22 transitions. [2020-07-29 03:26:31,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 03:26:31,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 03:26:31,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2020-07-29 03:26:31,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:31,849 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 03:26:31,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2020-07-29 03:26:31,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-29 03:26:31,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:31,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 22 transitions. Second operand 16 states. [2020-07-29 03:26:31,878 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 22 transitions. Second operand 16 states. [2020-07-29 03:26:31,880 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 16 states. [2020-07-29 03:26:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:31,885 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-29 03:26:31,886 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-29 03:26:31,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:31,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:31,887 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states and 22 transitions. [2020-07-29 03:26:31,887 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states and 22 transitions. [2020-07-29 03:26:31,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:31,889 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-29 03:26:31,889 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-29 03:26:31,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:31,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:31,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:31,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 03:26:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-07-29 03:26:31,893 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 03:26:31,893 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 03:26:31,893 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:26:31,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2020-07-29 03:26:31,894 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:26:31,894 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:31,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:31,895 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:31,895 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:26:31,896 INFO L794 eck$LassoCheckResult]: Stem: 169#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 166#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 167#L528 assume !(main_~length1~0 < 1); 158#L528-2 assume !(main_~length2~0 < 1); 159#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 162#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 163#L537-4 main_~i~1 := 0; 164#L541-3 [2020-07-29 03:26:31,896 INFO L796 eck$LassoCheckResult]: Loop: 164#L541-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 171#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 164#L541-3 [2020-07-29 03:26:31,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:31,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935662, now seen corresponding path program 1 times [2020-07-29 03:26:31,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:31,897 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874334804] [2020-07-29 03:26:31,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:31,909 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:31,918 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:31,925 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:31,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:31,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2020-07-29 03:26:31,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:31,929 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110591448] [2020-07-29 03:26:31,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:31,942 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:31,952 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:31,954 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:31,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:31,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384784, now seen corresponding path program 1 times [2020-07-29 03:26:31,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:31,956 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962028611] [2020-07-29 03:26:31,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:31,991 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:32,007 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:32,012 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:32,208 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2020-07-29 03:26:32,291 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:32,291 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:32,291 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:32,291 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:32,291 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:32,292 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:32,292 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:32,292 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:32,292 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca-2.i_Iteration2_Lasso [2020-07-29 03:26:32,292 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:32,292 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:32,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:32,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:32,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:32,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:32,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:32,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:32,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:32,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:32,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:32,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:32,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:32,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:32,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:32,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:33,114 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:33,114 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:33,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:33,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:33,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:33,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:33,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:33,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:33,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:33,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:33,126 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 03:26:33,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:33,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:33,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:33,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:33,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:33,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:33,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:33,173 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 03:26:33,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:33,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:33,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:33,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:33,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:33,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:33,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:33,209 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:33,231 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:33,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:33,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:33,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:33,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:33,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:33,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:33,238 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:33,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:33,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:33,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:33,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:33,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:33,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:33,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:33,300 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:33,330 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-07-29 03:26:33,330 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:33,334 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:33,337 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:33,338 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:33,338 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2, ULTIMATE.start_main_~nondetString2~0.offset) = -1*ULTIMATE.start_main_~i~1 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_2 - 1*ULTIMATE.start_main_~nondetString2~0.offset Supporting invariants [] [2020-07-29 03:26:33,387 INFO L297 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:26:33,392 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13;" "main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12;" [2020-07-29 03:26:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:33,397 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:26:33,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:33,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:26:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:33,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:33,466 INFO L280 TraceCheckUtils]: 0: Hoare triple {213#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {213#unseeded} is VALID [2020-07-29 03:26:33,467 INFO L280 TraceCheckUtils]: 1: Hoare triple {213#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; {213#unseeded} is VALID [2020-07-29 03:26:33,468 INFO L280 TraceCheckUtils]: 2: Hoare triple {213#unseeded} assume !(main_~length1~0 < 1); {213#unseeded} is VALID [2020-07-29 03:26:33,468 INFO L280 TraceCheckUtils]: 3: Hoare triple {213#unseeded} assume !(main_~length2~0 < 1); {213#unseeded} is VALID [2020-07-29 03:26:33,470 INFO L280 TraceCheckUtils]: 4: Hoare triple {213#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; {257#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:33,471 INFO L280 TraceCheckUtils]: 5: Hoare triple {257#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !(main_~i~0 < main_~length1~0 - 1); {257#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:33,472 INFO L280 TraceCheckUtils]: 6: Hoare triple {257#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} main_~i~1 := 0; {257#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:33,478 WARN L261 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:26:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:33,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:33,510 INFO L280 TraceCheckUtils]: 0: Hoare triple {258#(and (>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~1) (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) (* (- 1) ULTIMATE.start_main_~nondetString2~0.offset))) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; {284#(and (<= (+ ULTIMATE.start_main_~nondetString2~0.offset ULTIMATE.start_main_~i~1 1) (select |#length| ULTIMATE.start_main_~nondetString2~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) (+ oldRank0 ULTIMATE.start_main_~nondetString2~0.offset ULTIMATE.start_main_~i~1)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|))} is VALID [2020-07-29 03:26:33,512 INFO L280 TraceCheckUtils]: 1: Hoare triple {284#(and (<= (+ ULTIMATE.start_main_~nondetString2~0.offset ULTIMATE.start_main_~i~1 1) (select |#length| ULTIMATE.start_main_~nondetString2~0.base)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) (+ oldRank0 ULTIMATE.start_main_~nondetString2~0.offset ULTIMATE.start_main_~i~1)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|))} main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; {260#(and (or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~1) (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) (* (- 1) ULTIMATE.start_main_~nondetString2~0.offset))) (>= oldRank0 0)) unseeded) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|))} is VALID [2020-07-29 03:26:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:33,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:26:33,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:33,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:33,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,534 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 03:26:33,534 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-07-29 03:26:33,654 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 23 states and 34 transitions. Complement of second has 7 states. [2020-07-29 03:26:33,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:33,654 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:33,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. cyclomatic complexity: 9 [2020-07-29 03:26:33,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:33,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:33,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:26:33,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:33,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:33,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:33,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 34 transitions. [2020-07-29 03:26:33,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:33,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:33,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:33,659 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 22 transitions. cyclomatic complexity: 9 [2020-07-29 03:26:33,661 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:26:33,661 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:26:33,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:33,663 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:33,663 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 34 transitions. cyclomatic complexity: 15 [2020-07-29 03:26:33,664 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:26:33,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:33,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:33,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 34 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:33,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:33,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:33,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 34 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:33,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:33,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:33,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 34 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:33,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 23 letters. Loop has 23 letters. [2020-07-29 03:26:33,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 03:26:33,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 34 transitions. cyclomatic complexity: 15 Stem has 23 letters. Loop has 23 letters. [2020-07-29 03:26:33,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:26:33,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:26:33,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 34 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:26:33,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:33,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:33,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 34 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:33,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:33,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:33,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 34 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:33,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:33,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:33,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 34 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:33,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:33,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:33,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 34 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:33,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:33,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:33,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 34 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:33,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:33,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:33,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 34 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:33,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:33,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:33,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 34 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:26:33,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:33,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:33,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 34 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:26:33,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:33,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:33,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 34 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 3 letters. [2020-07-29 03:26:33,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:33,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:33,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 34 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:33,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:33,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:33,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 34 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:26:33,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:33,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:33,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 34 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 3 letters. [2020-07-29 03:26:33,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,688 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:26:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-07-29 03:26:33,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:26:33,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:26:33,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:26:33,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:33,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 34 transitions. cyclomatic complexity: 15 [2020-07-29 03:26:33,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:33,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 17 states and 24 transitions. [2020-07-29 03:26:33,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 03:26:33,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 03:26:33,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2020-07-29 03:26:33,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:33,696 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-07-29 03:26:33,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2020-07-29 03:26:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-29 03:26:33,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:33,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 24 transitions. Second operand 17 states. [2020-07-29 03:26:33,698 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 24 transitions. Second operand 17 states. [2020-07-29 03:26:33,717 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second operand 17 states. [2020-07-29 03:26:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:33,718 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2020-07-29 03:26:33,719 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2020-07-29 03:26:33,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:33,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:33,719 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states and 24 transitions. [2020-07-29 03:26:33,719 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states and 24 transitions. [2020-07-29 03:26:33,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:33,737 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2020-07-29 03:26:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2020-07-29 03:26:33,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:33,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:33,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:33,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 03:26:33,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2020-07-29 03:26:33,739 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-07-29 03:26:33,739 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-07-29 03:26:33,739 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:26:33,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2020-07-29 03:26:33,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:33,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:33,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:33,741 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:33,741 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:26:33,741 INFO L794 eck$LassoCheckResult]: Stem: 336#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 333#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 334#L528 assume !(main_~length1~0 < 1); 325#L528-2 assume !(main_~length2~0 < 1); 326#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 329#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 330#L537-4 main_~i~1 := 0; 331#L541-3 assume !(main_~i~1 < main_~length2~0 - 1); 323#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 324#L522 [2020-07-29 03:26:33,742 INFO L796 eck$LassoCheckResult]: Loop: 324#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 332#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 337#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; 335#L521 assume cstrspn_~sc~0 == cstrspn_~c~0; 324#L522 [2020-07-29 03:26:33,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:33,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1298384726, now seen corresponding path program 1 times [2020-07-29 03:26:33,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:33,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336939727] [2020-07-29 03:26:33,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:33,761 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:33,777 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:33,782 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:33,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:33,782 INFO L82 PathProgramCache]: Analyzing trace with hash 2312936, now seen corresponding path program 1 times [2020-07-29 03:26:33,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:33,783 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416837265] [2020-07-29 03:26:33,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:33,790 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:33,804 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:33,807 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:33,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:33,809 INFO L82 PathProgramCache]: Analyzing trace with hash -587636803, now seen corresponding path program 1 times [2020-07-29 03:26:33,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:33,811 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287303180] [2020-07-29 03:26:33,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:34,087 INFO L280 TraceCheckUtils]: 0: Hoare triple {381#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {381#true} is VALID [2020-07-29 03:26:34,087 INFO L280 TraceCheckUtils]: 1: Hoare triple {381#true} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; {381#true} is VALID [2020-07-29 03:26:34,088 INFO L280 TraceCheckUtils]: 2: Hoare triple {381#true} assume !(main_~length1~0 < 1); {381#true} is VALID [2020-07-29 03:26:34,088 INFO L280 TraceCheckUtils]: 3: Hoare triple {381#true} assume !(main_~length2~0 < 1); {383#(<= 1 ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:26:34,089 INFO L280 TraceCheckUtils]: 4: Hoare triple {383#(<= 1 ULTIMATE.start_main_~length2~0)} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; {384#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:34,090 INFO L280 TraceCheckUtils]: 5: Hoare triple {384#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~0 < main_~length1~0 - 1); {384#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:34,091 INFO L280 TraceCheckUtils]: 6: Hoare triple {384#(and (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_~i~1 := 0; {385#(and (or (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (and (= 0 ULTIMATE.start_main_~i~1) (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:34,091 INFO L280 TraceCheckUtils]: 7: Hoare triple {385#(and (or (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (and (= 0 ULTIMATE.start_main_~i~1) (< 0 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)))) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~1 < main_~length2~0 - 1); {386#(and (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:26:34,093 INFO L280 TraceCheckUtils]: 8: Hoare triple {386#(and (= 1 (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; {387#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base) ULTIMATE.start_cstrspn_~s2.offset))} is VALID [2020-07-29 03:26:34,093 INFO L280 TraceCheckUtils]: 9: Hoare triple {387#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base) ULTIMATE.start_cstrspn_~s2.offset))} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; {388#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~spanp~0.base) ULTIMATE.start_cstrspn_~spanp~0.offset))} is VALID [2020-07-29 03:26:34,094 INFO L280 TraceCheckUtils]: 10: Hoare triple {388#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~spanp~0.base) ULTIMATE.start_cstrspn_~spanp~0.offset))} cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; {389#(= 0 ULTIMATE.start_cstrspn_~sc~0)} is VALID [2020-07-29 03:26:34,095 INFO L280 TraceCheckUtils]: 11: Hoare triple {389#(= 0 ULTIMATE.start_cstrspn_~sc~0)} assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; {382#false} is VALID [2020-07-29 03:26:34,095 INFO L280 TraceCheckUtils]: 12: Hoare triple {382#false} assume cstrspn_~sc~0 == cstrspn_~c~0; {382#false} is VALID [2020-07-29 03:26:34,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:34,097 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287303180] [2020-07-29 03:26:34,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:34,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-29 03:26:34,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100795342] [2020-07-29 03:26:34,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:34,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 03:26:34,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-29 03:26:34,205 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. cyclomatic complexity: 10 Second operand 9 states. [2020-07-29 03:26:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:34,492 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2020-07-29 03:26:34,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 03:26:34,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 03:26:34,515 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 03:26:34,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2020-07-29 03:26:34,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:34,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 18 states and 24 transitions. [2020-07-29 03:26:34,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 03:26:34,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 03:26:34,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2020-07-29 03:26:34,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:34,519 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-07-29 03:26:34,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2020-07-29 03:26:34,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-07-29 03:26:34,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:34,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 24 transitions. Second operand 17 states. [2020-07-29 03:26:34,520 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 24 transitions. Second operand 17 states. [2020-07-29 03:26:34,521 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand 17 states. [2020-07-29 03:26:34,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:34,522 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2020-07-29 03:26:34,523 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2020-07-29 03:26:34,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:34,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:34,523 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states and 24 transitions. [2020-07-29 03:26:34,523 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states and 24 transitions. [2020-07-29 03:26:34,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:34,525 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2020-07-29 03:26:34,525 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2020-07-29 03:26:34,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:34,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:34,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:34,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 03:26:34,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2020-07-29 03:26:34,527 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-07-29 03:26:34,527 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2020-07-29 03:26:34,527 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:26:34,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2020-07-29 03:26:34,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:34,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:34,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:34,529 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:34,529 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:26:34,529 INFO L794 eck$LassoCheckResult]: Stem: 431#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 428#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 429#L528 assume !(main_~length1~0 < 1); 420#L528-2 assume !(main_~length2~0 < 1); 421#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 424#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 425#L537-4 main_~i~1 := 0; 426#L541-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 433#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 434#L541-3 assume !(main_~i~1 < main_~length2~0 - 1); 418#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 419#L522 [2020-07-29 03:26:34,529 INFO L796 eck$LassoCheckResult]: Loop: 419#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 427#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 432#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; 430#L521 assume cstrspn_~sc~0 == cstrspn_~c~0; 419#L522 [2020-07-29 03:26:34,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:34,530 INFO L82 PathProgramCache]: Analyzing trace with hash -2087704584, now seen corresponding path program 1 times [2020-07-29 03:26:34,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:34,530 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978889133] [2020-07-29 03:26:34,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:34,547 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:34,561 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:34,565 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:34,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:34,566 INFO L82 PathProgramCache]: Analyzing trace with hash 2312936, now seen corresponding path program 2 times [2020-07-29 03:26:34,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:34,567 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081671504] [2020-07-29 03:26:34,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:34,572 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:34,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:34,577 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:34,579 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:34,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:34,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1860214623, now seen corresponding path program 1 times [2020-07-29 03:26:34,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:34,580 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826071054] [2020-07-29 03:26:34,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:34,808 INFO L280 TraceCheckUtils]: 0: Hoare triple {478#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {478#true} is VALID [2020-07-29 03:26:34,809 INFO L280 TraceCheckUtils]: 1: Hoare triple {478#true} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; {478#true} is VALID [2020-07-29 03:26:34,809 INFO L280 TraceCheckUtils]: 2: Hoare triple {478#true} assume !(main_~length1~0 < 1); {480#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:26:34,810 INFO L280 TraceCheckUtils]: 3: Hoare triple {480#(<= 1 ULTIMATE.start_main_~length1~0)} assume !(main_~length2~0 < 1); {480#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:26:34,812 INFO L280 TraceCheckUtils]: 4: Hoare triple {480#(<= 1 ULTIMATE.start_main_~length1~0)} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; {481#(and (or (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (not (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 ULTIMATE.start_main_~i~0) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:26:34,813 INFO L280 TraceCheckUtils]: 5: Hoare triple {481#(and (or (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (not (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))) (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 ULTIMATE.start_main_~i~0) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} assume !(main_~i~0 < main_~length1~0 - 1); {482#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (<= ULTIMATE.start_main_~length1~0 1))} is VALID [2020-07-29 03:26:34,816 INFO L280 TraceCheckUtils]: 6: Hoare triple {482#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (<= ULTIMATE.start_main_~length1~0 1))} main_~i~1 := 0; {482#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (<= ULTIMATE.start_main_~length1~0 1))} is VALID [2020-07-29 03:26:34,817 INFO L280 TraceCheckUtils]: 7: Hoare triple {482#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (<= ULTIMATE.start_main_~length1~0 1))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; {482#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (<= ULTIMATE.start_main_~length1~0 1))} is VALID [2020-07-29 03:26:34,818 INFO L280 TraceCheckUtils]: 8: Hoare triple {482#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (<= ULTIMATE.start_main_~length1~0 1))} main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; {482#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (<= ULTIMATE.start_main_~length1~0 1))} is VALID [2020-07-29 03:26:34,819 INFO L280 TraceCheckUtils]: 9: Hoare triple {482#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (<= ULTIMATE.start_main_~length1~0 1))} assume !(main_~i~1 < main_~length2~0 - 1); {482#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (<= ULTIMATE.start_main_~length1~0 1))} is VALID [2020-07-29 03:26:34,821 INFO L280 TraceCheckUtils]: 10: Hoare triple {482#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (<= ULTIMATE.start_main_~length1~0 1))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; {483#(and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) 0)) (= 0 ULTIMATE.start_cstrspn_~p~0.offset))} is VALID [2020-07-29 03:26:34,822 INFO L280 TraceCheckUtils]: 11: Hoare triple {483#(and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) 0)) (= 0 ULTIMATE.start_cstrspn_~p~0.offset))} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; {484#(= 0 ULTIMATE.start_cstrspn_~c~0)} is VALID [2020-07-29 03:26:34,823 INFO L280 TraceCheckUtils]: 12: Hoare triple {484#(= 0 ULTIMATE.start_cstrspn_~c~0)} cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; {484#(= 0 ULTIMATE.start_cstrspn_~c~0)} is VALID [2020-07-29 03:26:34,824 INFO L280 TraceCheckUtils]: 13: Hoare triple {484#(= 0 ULTIMATE.start_cstrspn_~c~0)} assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; {485#(not (= ULTIMATE.start_cstrspn_~c~0 ULTIMATE.start_cstrspn_~sc~0))} is VALID [2020-07-29 03:26:34,825 INFO L280 TraceCheckUtils]: 14: Hoare triple {485#(not (= ULTIMATE.start_cstrspn_~c~0 ULTIMATE.start_cstrspn_~sc~0))} assume cstrspn_~sc~0 == cstrspn_~c~0; {479#false} is VALID [2020-07-29 03:26:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:26:34,829 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826071054] [2020-07-29 03:26:34,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:26:34,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-29 03:26:34,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237606081] [2020-07-29 03:26:34,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:34,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 03:26:34,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-29 03:26:34,928 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-07-29 03:26:35,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:35,337 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2020-07-29 03:26:35,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 03:26:35,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 03:26:35,364 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 03:26:35,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2020-07-29 03:26:35,366 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 03:26:35,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 36 transitions. [2020-07-29 03:26:35,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-07-29 03:26:35,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-07-29 03:26:35,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2020-07-29 03:26:35,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:35,367 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2020-07-29 03:26:35,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2020-07-29 03:26:35,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2020-07-29 03:26:35,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:35,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states and 36 transitions. Second operand 26 states. [2020-07-29 03:26:35,370 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states and 36 transitions. Second operand 26 states. [2020-07-29 03:26:35,370 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand 26 states. [2020-07-29 03:26:35,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:35,371 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2020-07-29 03:26:35,372 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2020-07-29 03:26:35,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:35,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:35,372 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 29 states and 36 transitions. [2020-07-29 03:26:35,373 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 29 states and 36 transitions. [2020-07-29 03:26:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:35,374 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2020-07-29 03:26:35,374 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2020-07-29 03:26:35,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:35,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:35,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:35,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:35,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-29 03:26:35,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2020-07-29 03:26:35,377 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-07-29 03:26:35,377 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-07-29 03:26:35,377 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:26:35,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2020-07-29 03:26:35,378 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 03:26:35,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:35,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:35,378 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:35,379 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:35,379 INFO L794 eck$LassoCheckResult]: Stem: 541#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 537#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 538#L528 assume !(main_~length1~0 < 1); 527#L528-2 assume !(main_~length2~0 < 1); 528#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 531#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 532#L537-4 main_~i~1 := 0; 534#L541-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 544#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 545#L541-3 assume !(main_~i~1 < main_~length2~0 - 1); 525#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 526#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 540#L520-3 [2020-07-29 03:26:35,379 INFO L796 eck$LassoCheckResult]: Loop: 540#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 546#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; 539#L521 assume !(cstrspn_~sc~0 == cstrspn_~c~0); 540#L520-3 [2020-07-29 03:26:35,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:35,380 INFO L82 PathProgramCache]: Analyzing trace with hash -294332619, now seen corresponding path program 1 times [2020-07-29 03:26:35,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:35,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604316508] [2020-07-29 03:26:35,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:35,395 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:35,409 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:35,414 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:35,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:35,414 INFO L82 PathProgramCache]: Analyzing trace with hash 78613, now seen corresponding path program 1 times [2020-07-29 03:26:35,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:35,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787966606] [2020-07-29 03:26:35,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:35,419 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:35,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:35,421 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:35,423 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:35,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:35,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1860214625, now seen corresponding path program 1 times [2020-07-29 03:26:35,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:35,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649302643] [2020-07-29 03:26:35,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:35,441 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:35,458 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:35,463 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:36,051 WARN L193 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 117 [2020-07-29 03:26:36,317 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-07-29 03:26:36,322 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:36,322 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:36,322 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:36,322 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:36,322 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:36,323 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:36,323 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:36,323 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:36,323 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca-2.i_Iteration5_Lasso [2020-07-29 03:26:36,323 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:36,323 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:36,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:36,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:36,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:36,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:36,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:36,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:36,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:36,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:36,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:36,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:36,902 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 85 [2020-07-29 03:26:37,045 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:26:37,045 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:26:37,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:37,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:37,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:37,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:37,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:37,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:37,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:37,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:37,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:37,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:37,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:37,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:37,588 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2020-07-29 03:26:38,222 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:38,222 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:38,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:38,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:38,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:38,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:38,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:38,229 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 03:26:38,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:38,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:38,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:38,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:38,257 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:38,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:38,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:38,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:38,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:38,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:38,283 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 03:26:38,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:38,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:38,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:38,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:38,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:38,309 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 03:26:38,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:38,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:38,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:38,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:38,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:38,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:38,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:38,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:38,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:38,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:38,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:38,362 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:38,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:38,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:38,388 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:38,388 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:38,395 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:38,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:38,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:38,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:38,420 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:38,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:38,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:38,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:38,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:38,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:38,447 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:38,451 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:38,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:38,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:38,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:38,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:38,485 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) [2020-07-29 03:26:38,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:38,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:38,521 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:38,521 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:38,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:38,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:38,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:38,576 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:38,576 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:38,592 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:38,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:38,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:38,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:38,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:38,627 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:38,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:38,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:38,652 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:38,652 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:38,656 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:38,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:38,691 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:38,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:38,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:38,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:38,700 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:38,700 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:38,723 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:38,781 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-07-29 03:26:38,781 INFO L444 ModelExtractionUtils]: 7 out of 49 variables were initially zero. Simplification set additionally 39 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:38,783 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:38,785 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:38,785 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:38,785 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrspn_~spanp~0.offset, v_rep(select #length ULTIMATE.start_cstrspn_~spanp~0.base)_1) = -1*ULTIMATE.start_cstrspn_~spanp~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrspn_~spanp~0.base)_1 Supporting invariants [] [2020-07-29 03:26:38,898 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2020-07-29 03:26:38,901 INFO L393 LassoCheck]: Loop: "cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5;" "assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5;" "assume !(cstrspn_~sc~0 == cstrspn_~c~0);" [2020-07-29 03:26:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:38,906 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:26:38,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:38,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:26:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:38,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:38,955 INFO L280 TraceCheckUtils]: 0: Hoare triple {618#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {618#unseeded} is VALID [2020-07-29 03:26:38,955 INFO L280 TraceCheckUtils]: 1: Hoare triple {618#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; {618#unseeded} is VALID [2020-07-29 03:26:38,956 INFO L280 TraceCheckUtils]: 2: Hoare triple {618#unseeded} assume !(main_~length1~0 < 1); {618#unseeded} is VALID [2020-07-29 03:26:38,957 INFO L280 TraceCheckUtils]: 3: Hoare triple {618#unseeded} assume !(main_~length2~0 < 1); {618#unseeded} is VALID [2020-07-29 03:26:38,957 INFO L280 TraceCheckUtils]: 4: Hoare triple {618#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; {618#unseeded} is VALID [2020-07-29 03:26:38,958 INFO L280 TraceCheckUtils]: 5: Hoare triple {618#unseeded} assume !(main_~i~0 < main_~length1~0 - 1); {618#unseeded} is VALID [2020-07-29 03:26:38,958 INFO L280 TraceCheckUtils]: 6: Hoare triple {618#unseeded} main_~i~1 := 0; {618#unseeded} is VALID [2020-07-29 03:26:38,958 INFO L280 TraceCheckUtils]: 7: Hoare triple {618#unseeded} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; {618#unseeded} is VALID [2020-07-29 03:26:38,961 INFO L280 TraceCheckUtils]: 8: Hoare triple {618#unseeded} main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; {618#unseeded} is VALID [2020-07-29 03:26:38,962 INFO L280 TraceCheckUtils]: 9: Hoare triple {618#unseeded} assume !(main_~i~1 < main_~length2~0 - 1); {618#unseeded} is VALID [2020-07-29 03:26:38,962 INFO L280 TraceCheckUtils]: 10: Hoare triple {618#unseeded} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; {618#unseeded} is VALID [2020-07-29 03:26:38,963 INFO L280 TraceCheckUtils]: 11: Hoare triple {618#unseeded} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; {618#unseeded} is VALID [2020-07-29 03:26:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:38,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 03:26:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:38,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:39,102 INFO L280 TraceCheckUtils]: 0: Hoare triple {621#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_cstrspn_~spanp~0.offset) (select |#length| ULTIMATE.start_cstrspn_~spanp~0.base)))} cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; {769#(and (<= 1 oldRank0) (<= (+ (select |#length| ULTIMATE.start_cstrspn_~spanp~0.base) 1) (+ ULTIMATE.start_cstrspn_~spanp~0.offset oldRank0)))} is VALID [2020-07-29 03:26:39,103 INFO L280 TraceCheckUtils]: 1: Hoare triple {769#(and (<= 1 oldRank0) (<= (+ (select |#length| ULTIMATE.start_cstrspn_~spanp~0.base) 1) (+ ULTIMATE.start_cstrspn_~spanp~0.offset oldRank0)))} assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; {769#(and (<= 1 oldRank0) (<= (+ (select |#length| ULTIMATE.start_cstrspn_~spanp~0.base) 1) (+ ULTIMATE.start_cstrspn_~spanp~0.offset oldRank0)))} is VALID [2020-07-29 03:26:39,104 INFO L280 TraceCheckUtils]: 2: Hoare triple {769#(and (<= 1 oldRank0) (<= (+ (select |#length| ULTIMATE.start_cstrspn_~spanp~0.base) 1) (+ ULTIMATE.start_cstrspn_~spanp~0.offset oldRank0)))} assume !(cstrspn_~sc~0 == cstrspn_~c~0); {731#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_cstrspn_~spanp~0.offset) (select |#length| ULTIMATE.start_cstrspn_~spanp~0.base)))) unseeded)} is VALID [2020-07-29 03:26:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:39,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:26:39,117 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 03:26:39,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:39,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,118 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:26:39,118 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 33 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-07-29 03:26:39,157 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 33 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 38 states and 46 transitions. Complement of second has 5 states. [2020-07-29 03:26:39,157 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 03:26:39,157 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:39,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. cyclomatic complexity: 12 [2020-07-29 03:26:39,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:39,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:39,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:26:39,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:39,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:39,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:39,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 46 transitions. [2020-07-29 03:26:39,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:39,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:39,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:39,161 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 33 transitions. cyclomatic complexity: 12 [2020-07-29 03:26:39,163 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 03:26:39,163 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:26:39,164 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:39,164 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:39,164 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 46 transitions. cyclomatic complexity: 14 [2020-07-29 03:26:39,166 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:26:39,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:39,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:39,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 46 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:39,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 1 letters. [2020-07-29 03:26:39,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 03:26:39,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 46 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 1 letters. [2020-07-29 03:26:39,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 12 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:39,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:39,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 46 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:39,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 12 Stem has 38 letters. Loop has 38 letters. [2020-07-29 03:26:39,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 38 letters. [2020-07-29 03:26:39,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 46 transitions. cyclomatic complexity: 14 Stem has 38 letters. Loop has 38 letters. [2020-07-29 03:26:39,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 12 Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:26:39,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:26:39,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 46 transitions. cyclomatic complexity: 14 Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:26:39,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:26:39,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:26:39,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 46 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:26:39,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:26:39,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:26:39,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 46 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:26:39,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:39,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:39,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 46 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:39,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:39,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:39,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 46 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:39,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:39,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:39,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 46 transitions. cyclomatic complexity: 14 Stem has 16 letters. Loop has 3 letters. [2020-07-29 03:26:39,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:39,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:39,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 46 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 3 letters. [2020-07-29 03:26:39,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:39,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:39,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 46 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 3 letters. [2020-07-29 03:26:39,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:39,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:39,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 46 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:39,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 1 letters. [2020-07-29 03:26:39,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 03:26:39,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 46 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 1 letters. [2020-07-29 03:26:39,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 12 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:39,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:39,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 46 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:39,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 12 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:39,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:39,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 46 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:39,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 12 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:39,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:39,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 46 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:39,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 12 Stem has 21 letters. Loop has 4 letters. [2020-07-29 03:26:39,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 4 letters. [2020-07-29 03:26:39,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 46 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 4 letters. [2020-07-29 03:26:39,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,186 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:39,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:26:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2020-07-29 03:26:39,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 12 letters. Loop has 3 letters. [2020-07-29 03:26:39,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 03:26:39,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 12 letters. Loop has 6 letters. [2020-07-29 03:26:39,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:39,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 46 transitions. cyclomatic complexity: 14 [2020-07-29 03:26:39,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:39,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 24 states and 30 transitions. [2020-07-29 03:26:39,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 03:26:39,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 03:26:39,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 30 transitions. [2020-07-29 03:26:39,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:39,191 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-07-29 03:26:39,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 30 transitions. [2020-07-29 03:26:39,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2020-07-29 03:26:39,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:39,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 30 transitions. Second operand 23 states. [2020-07-29 03:26:39,192 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 30 transitions. Second operand 23 states. [2020-07-29 03:26:39,193 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 23 states. [2020-07-29 03:26:39,193 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:39,196 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2020-07-29 03:26:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2020-07-29 03:26:39,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:39,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:39,197 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states and 30 transitions. [2020-07-29 03:26:39,197 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states and 30 transitions. [2020-07-29 03:26:39,197 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:39,199 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2020-07-29 03:26:39,199 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2020-07-29 03:26:39,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:39,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:39,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:39,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:39,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 03:26:39,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2020-07-29 03:26:39,201 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2020-07-29 03:26:39,201 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2020-07-29 03:26:39,201 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:26:39,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2020-07-29 03:26:39,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:26:39,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:39,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:39,202 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:39,202 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:26:39,203 INFO L794 eck$LassoCheckResult]: Stem: 837#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 831#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 832#L528 assume !(main_~length1~0 < 1); 823#L528-2 assume !(main_~length2~0 < 1); 824#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 827#L537-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 825#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 826#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 828#L537-4 main_~i~1 := 0; 829#L541-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 841#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 842#L541-3 assume !(main_~i~1 < main_~length2~0 - 1); 821#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 822#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 830#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 840#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; 833#L521 assume cstrspn_~sc~0 == cstrspn_~c~0; 834#L522 [2020-07-29 03:26:39,203 INFO L796 eck$LassoCheckResult]: Loop: 834#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 843#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 838#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; 839#L521 assume cstrspn_~sc~0 == cstrspn_~c~0; 834#L522 [2020-07-29 03:26:39,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:39,203 INFO L82 PathProgramCache]: Analyzing trace with hash -796682687, now seen corresponding path program 1 times [2020-07-29 03:26:39,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:39,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115294721] [2020-07-29 03:26:39,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,221 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,237 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,243 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:39,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:39,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2312936, now seen corresponding path program 3 times [2020-07-29 03:26:39,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:39,244 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824985596] [2020-07-29 03:26:39,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,248 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:39,251 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:39,252 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:39,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:39,254 INFO L82 PathProgramCache]: Analyzing trace with hash 477217064, now seen corresponding path program 2 times [2020-07-29 03:26:39,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:39,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751106440] [2020-07-29 03:26:39,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:39,623 INFO L280 TraceCheckUtils]: 0: Hoare triple {980#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {980#true} is VALID [2020-07-29 03:26:39,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {980#true} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; {980#true} is VALID [2020-07-29 03:26:39,624 INFO L280 TraceCheckUtils]: 2: Hoare triple {980#true} assume !(main_~length1~0 < 1); {980#true} is VALID [2020-07-29 03:26:39,624 INFO L280 TraceCheckUtils]: 3: Hoare triple {980#true} assume !(main_~length2~0 < 1); {980#true} is VALID [2020-07-29 03:26:39,629 INFO L280 TraceCheckUtils]: 4: Hoare triple {980#true} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; {982#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 ULTIMATE.start_main_~i~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)))} is VALID [2020-07-29 03:26:39,630 INFO L280 TraceCheckUtils]: 5: Hoare triple {982#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 ULTIMATE.start_main_~i~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; {983#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 ULTIMATE.start_main_~i~0) (< 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (or (not (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))))} is VALID [2020-07-29 03:26:39,630 INFO L280 TraceCheckUtils]: 6: Hoare triple {983#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (= 0 ULTIMATE.start_main_~i~0) (< 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (or (not (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))))} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {984#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (or (not (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (or (and (<= 2 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~0 1)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))))} is VALID [2020-07-29 03:26:39,631 INFO L280 TraceCheckUtils]: 7: Hoare triple {984#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (or (not (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (or (and (<= 2 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~0 1)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0))))} assume !(main_~i~0 < main_~length1~0 - 1); {985#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:26:39,632 INFO L280 TraceCheckUtils]: 8: Hoare triple {985#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} main_~i~1 := 0; {985#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:26:39,632 INFO L280 TraceCheckUtils]: 9: Hoare triple {985#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; {985#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:26:39,633 INFO L280 TraceCheckUtils]: 10: Hoare triple {985#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; {985#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:26:39,634 INFO L280 TraceCheckUtils]: 11: Hoare triple {985#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} assume !(main_~i~1 < main_~length2~0 - 1); {985#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:26:39,635 INFO L280 TraceCheckUtils]: 12: Hoare triple {985#(and (= 0 ULTIMATE.start_main_~nondetString1~0.offset) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 2 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; {986#(and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) 1)) (= 0 ULTIMATE.start_cstrspn_~p~0.offset))} is VALID [2020-07-29 03:26:39,636 INFO L280 TraceCheckUtils]: 13: Hoare triple {986#(and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) 1)) (= 0 ULTIMATE.start_cstrspn_~p~0.offset))} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; {987#(and (<= ULTIMATE.start_cstrspn_~p~0.offset 1) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) 1)) (<= 1 ULTIMATE.start_cstrspn_~p~0.offset))} is VALID [2020-07-29 03:26:39,638 INFO L280 TraceCheckUtils]: 14: Hoare triple {987#(and (<= ULTIMATE.start_cstrspn_~p~0.offset 1) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) 1)) (<= 1 ULTIMATE.start_cstrspn_~p~0.offset))} cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; {987#(and (<= ULTIMATE.start_cstrspn_~p~0.offset 1) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) 1)) (<= 1 ULTIMATE.start_cstrspn_~p~0.offset))} is VALID [2020-07-29 03:26:39,639 INFO L280 TraceCheckUtils]: 15: Hoare triple {987#(and (<= ULTIMATE.start_cstrspn_~p~0.offset 1) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) 1)) (<= 1 ULTIMATE.start_cstrspn_~p~0.offset))} assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; {987#(and (<= ULTIMATE.start_cstrspn_~p~0.offset 1) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) 1)) (<= 1 ULTIMATE.start_cstrspn_~p~0.offset))} is VALID [2020-07-29 03:26:39,640 INFO L280 TraceCheckUtils]: 16: Hoare triple {987#(and (<= ULTIMATE.start_cstrspn_~p~0.offset 1) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) 1)) (<= 1 ULTIMATE.start_cstrspn_~p~0.offset))} assume cstrspn_~sc~0 == cstrspn_~c~0; {987#(and (<= ULTIMATE.start_cstrspn_~p~0.offset 1) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) 1)) (<= 1 ULTIMATE.start_cstrspn_~p~0.offset))} is VALID [2020-07-29 03:26:39,641 INFO L280 TraceCheckUtils]: 17: Hoare triple {987#(and (<= ULTIMATE.start_cstrspn_~p~0.offset 1) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) 1)) (<= 1 ULTIMATE.start_cstrspn_~p~0.offset))} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; {988#(= 0 ULTIMATE.start_cstrspn_~c~0)} is VALID [2020-07-29 03:26:39,642 INFO L280 TraceCheckUtils]: 18: Hoare triple {988#(= 0 ULTIMATE.start_cstrspn_~c~0)} cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; {988#(= 0 ULTIMATE.start_cstrspn_~c~0)} is VALID [2020-07-29 03:26:39,642 INFO L280 TraceCheckUtils]: 19: Hoare triple {988#(= 0 ULTIMATE.start_cstrspn_~c~0)} assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; {989#(not (= ULTIMATE.start_cstrspn_~c~0 ULTIMATE.start_cstrspn_~sc~0))} is VALID [2020-07-29 03:26:39,642 INFO L280 TraceCheckUtils]: 20: Hoare triple {989#(not (= ULTIMATE.start_cstrspn_~c~0 ULTIMATE.start_cstrspn_~sc~0))} assume cstrspn_~sc~0 == cstrspn_~c~0; {981#false} is VALID [2020-07-29 03:26:39,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:26:39,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751106440] [2020-07-29 03:26:39,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654144283] [2020-07-29 03:26:39,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:26:39,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 03:26:39,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:26:39,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 49 conjunts are in the unsatisfiable core [2020-07-29 03:26:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:39,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:39,797 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-29 03:26:39,798 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2020-07-29 03:26:39,802 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:26:39,809 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:39,809 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:26:39,810 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2020-07-29 03:26:39,813 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:26:39,814 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_112|]. (let ((.cse0 (store |v_#valid_112| ULTIMATE.start_main_~nondetString1~0.base 1))) (and (= 0 ULTIMATE.start_main_~i~0) (= |#valid| (store .cse0 ULTIMATE.start_main_~nondetString2~0.base 1)) (<= (select .cse0 ULTIMATE.start_main_~nondetString2~0.base) 0))) [2020-07-29 03:26:39,814 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 ULTIMATE.start_main_~i~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base))) [2020-07-29 03:26:40,049 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 21 [2020-07-29 03:26:40,050 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:26:40,063 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:40,072 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-07-29 03:26:40,072 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:57, output treesize:41 [2020-07-29 03:26:40,077 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:26:40,077 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_71|, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_~nondetString2~0.offset]. (and (= (let ((.cse0 (store |v_#memory_int_71| ULTIMATE.start_cstrspn_~p~0.base (store (select |v_#memory_int_71| ULTIMATE.start_cstrspn_~p~0.base) (+ ULTIMATE.start_cstrspn_~p~0.offset ULTIMATE.start_main_~length1~0 (- 1)) 0)))) (store .cse0 ULTIMATE.start_cstrspn_~s2.base (store (select .cse0 ULTIMATE.start_cstrspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0))) |#memory_int|) (< 1 ULTIMATE.start_main_~length1~0) (= 1 (select |#valid| ULTIMATE.start_cstrspn_~p~0.base)) (= 1 (select |#valid| ULTIMATE.start_cstrspn_~s2.base)) (not (= ULTIMATE.start_cstrspn_~p~0.base ULTIMATE.start_cstrspn_~s2.base)) (<= ULTIMATE.start_main_~length1~0 2)) [2020-07-29 03:26:40,078 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_~nondetString2~0.offset]. (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) (+ ULTIMATE.start_cstrspn_~p~0.offset ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (= 1 (select |#valid| ULTIMATE.start_cstrspn_~p~0.base)) (= 1 (select |#valid| ULTIMATE.start_cstrspn_~s2.base)) (not (= ULTIMATE.start_cstrspn_~p~0.base ULTIMATE.start_cstrspn_~s2.base)) (<= ULTIMATE.start_main_~length1~0 2) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))))) [2020-07-29 03:26:40,330 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-29 03:26:40,332 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:26:40,341 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:40,359 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-29 03:26:40,360 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:31 [2020-07-29 03:26:40,363 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:26:40,363 WARN L407 uantifierElimination]: Input elimination task: ∃ [|ULTIMATE.start_cstrspn_#t~post4.base|, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_~length1~0, |#valid|]. (and (< 1 ULTIMATE.start_main_~length1~0) (= 1 (select |#valid| ULTIMATE.start_cstrspn_~p~0.base)) (<= ULTIMATE.start_main_~length1~0 2) (= 0 (select (select |#memory_int| |ULTIMATE.start_cstrspn_#t~post4.base|) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) (+ ULTIMATE.start_cstrspn_~p~0.offset ULTIMATE.start_main_~length1~0 (- 2)))) (not (= |ULTIMATE.start_cstrspn_#t~post4.base| ULTIMATE.start_cstrspn_~p~0.base)) (= 1 (select |#valid| |ULTIMATE.start_cstrspn_#t~post4.base|))) [2020-07-29 03:26:40,363 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|ULTIMATE.start_cstrspn_#t~post4.base|, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_~length1~0]. (and (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 2) (= 0 (select (select |#memory_int| |ULTIMATE.start_cstrspn_#t~post4.base|) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) (+ ULTIMATE.start_cstrspn_~p~0.offset ULTIMATE.start_main_~length1~0 (- 2)))) (not (= |ULTIMATE.start_cstrspn_#t~post4.base| ULTIMATE.start_cstrspn_~p~0.base))) [2020-07-29 03:26:40,735 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:26:40,738 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 23 [2020-07-29 03:26:40,739 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-29 03:26:40,753 INFO L624 ElimStorePlain]: treesize reduction 10, result has 58.3 percent of original size [2020-07-29 03:26:40,775 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:26:40,775 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:40, output treesize:3 [2020-07-29 03:26:40,779 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:26:40,780 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |ULTIMATE.start_cstrspn_#t~post4.base|, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_~length1~0, v_ULTIMATE.start_cstrspn_~p~0.base_14, ULTIMATE.start_cstrspn_~p~0.offset]. (let ((.cse0 (select |#memory_int| v_ULTIMATE.start_cstrspn_~p~0.base_14))) (and (< 1 ULTIMATE.start_main_~length1~0) (not (= |ULTIMATE.start_cstrspn_#t~post4.base| v_ULTIMATE.start_cstrspn_~p~0.base_14)) (<= ULTIMATE.start_main_~length1~0 2) (= 0 (select (select |#memory_int| |ULTIMATE.start_cstrspn_#t~post4.base|) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (= 0 (select .cse0 (+ ULTIMATE.start_cstrspn_~p~0.offset ULTIMATE.start_main_~length1~0 (- 3)))) (= (select .cse0 (+ ULTIMATE.start_cstrspn_~p~0.offset (- 1))) ULTIMATE.start_cstrspn_~c~0))) [2020-07-29 03:26:40,780 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 ULTIMATE.start_cstrspn_~c~0) [2020-07-29 03:26:40,814 INFO L280 TraceCheckUtils]: 0: Hoare triple {980#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {980#true} is VALID [2020-07-29 03:26:40,814 INFO L280 TraceCheckUtils]: 1: Hoare triple {980#true} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; {980#true} is VALID [2020-07-29 03:26:40,814 INFO L280 TraceCheckUtils]: 2: Hoare triple {980#true} assume !(main_~length1~0 < 1); {980#true} is VALID [2020-07-29 03:26:40,814 INFO L280 TraceCheckUtils]: 3: Hoare triple {980#true} assume !(main_~length2~0 < 1); {980#true} is VALID [2020-07-29 03:26:40,816 INFO L280 TraceCheckUtils]: 4: Hoare triple {980#true} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; {1005#(and (= 0 ULTIMATE.start_main_~i~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)))} is VALID [2020-07-29 03:26:40,816 INFO L280 TraceCheckUtils]: 5: Hoare triple {1005#(and (= 0 ULTIMATE.start_main_~i~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; {1009#(and (= 0 ULTIMATE.start_main_~i~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)) (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~length1~0))} is VALID [2020-07-29 03:26:40,817 INFO L280 TraceCheckUtils]: 6: Hoare triple {1009#(and (= 0 ULTIMATE.start_main_~i~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)) (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~length1~0))} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {1013#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 03:26:40,818 INFO L280 TraceCheckUtils]: 7: Hoare triple {1013#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~i~0 1))} assume !(main_~i~0 < main_~length1~0 - 1); {1017#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)))} is VALID [2020-07-29 03:26:40,819 INFO L280 TraceCheckUtils]: 8: Hoare triple {1017#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)))} main_~i~1 := 0; {1017#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)))} is VALID [2020-07-29 03:26:40,820 INFO L280 TraceCheckUtils]: 9: Hoare triple {1017#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; {1017#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)))} is VALID [2020-07-29 03:26:40,821 INFO L280 TraceCheckUtils]: 10: Hoare triple {1017#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)))} main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; {1017#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)))} is VALID [2020-07-29 03:26:40,822 INFO L280 TraceCheckUtils]: 11: Hoare triple {1017#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)))} assume !(main_~i~1 < main_~length2~0 - 1); {1017#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)))} is VALID [2020-07-29 03:26:40,826 INFO L280 TraceCheckUtils]: 12: Hoare triple {1017#(and (< 1 ULTIMATE.start_main_~length1~0) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (<= ULTIMATE.start_main_~length1~0 2) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; {1033#(and (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))))) (= 1 (select |#valid| ULTIMATE.start_cstrspn_~p~0.base)) (= 1 (select |#valid| ULTIMATE.start_cstrspn_~s2.base)) (not (= ULTIMATE.start_cstrspn_~p~0.base ULTIMATE.start_cstrspn_~s2.base)) (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) (+ ULTIMATE.start_cstrspn_~p~0.offset ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 2))))} is VALID [2020-07-29 03:26:40,829 INFO L280 TraceCheckUtils]: 13: Hoare triple {1033#(and (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~s2.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))))) (= 1 (select |#valid| ULTIMATE.start_cstrspn_~p~0.base)) (= 1 (select |#valid| ULTIMATE.start_cstrspn_~s2.base)) (not (= ULTIMATE.start_cstrspn_~p~0.base ULTIMATE.start_cstrspn_~s2.base)) (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) (+ ULTIMATE.start_cstrspn_~p~0.offset ULTIMATE.start_main_~length1~0 (- 1)))) (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 2))))} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; {1037#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 2) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) (+ ULTIMATE.start_cstrspn_~p~0.offset ULTIMATE.start_main_~length1~0 (- 2)))))) (= 1 (select |#valid| ULTIMATE.start_cstrspn_~p~0.base)) (= 1 (select |#valid| ULTIMATE.start_cstrspn_~spanp~0.base)) (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~spanp~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))))) (not (= ULTIMATE.start_cstrspn_~p~0.base ULTIMATE.start_cstrspn_~spanp~0.base)))} is VALID [2020-07-29 03:26:40,830 INFO L280 TraceCheckUtils]: 14: Hoare triple {1037#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 2) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) (+ ULTIMATE.start_cstrspn_~p~0.offset ULTIMATE.start_main_~length1~0 (- 2)))))) (= 1 (select |#valid| ULTIMATE.start_cstrspn_~p~0.base)) (= 1 (select |#valid| ULTIMATE.start_cstrspn_~spanp~0.base)) (exists ((ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~spanp~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1))))) (not (= ULTIMATE.start_cstrspn_~p~0.base ULTIMATE.start_cstrspn_~spanp~0.base)))} cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; {1041#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 2) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) (+ ULTIMATE.start_cstrspn_~p~0.offset ULTIMATE.start_main_~length1~0 (- 2)))))) (exists ((|ULTIMATE.start_cstrspn_#t~post4.base| Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| |ULTIMATE.start_cstrspn_#t~post4.base|) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= |ULTIMATE.start_cstrspn_#t~post4.base| ULTIMATE.start_cstrspn_~p~0.base)))))} is VALID [2020-07-29 03:26:40,831 INFO L280 TraceCheckUtils]: 15: Hoare triple {1041#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 2) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) (+ ULTIMATE.start_cstrspn_~p~0.offset ULTIMATE.start_main_~length1~0 (- 2)))))) (exists ((|ULTIMATE.start_cstrspn_#t~post4.base| Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| |ULTIMATE.start_cstrspn_#t~post4.base|) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= |ULTIMATE.start_cstrspn_#t~post4.base| ULTIMATE.start_cstrspn_~p~0.base)))))} assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; {1041#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 2) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) (+ ULTIMATE.start_cstrspn_~p~0.offset ULTIMATE.start_main_~length1~0 (- 2)))))) (exists ((|ULTIMATE.start_cstrspn_#t~post4.base| Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| |ULTIMATE.start_cstrspn_#t~post4.base|) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= |ULTIMATE.start_cstrspn_#t~post4.base| ULTIMATE.start_cstrspn_~p~0.base)))))} is VALID [2020-07-29 03:26:40,832 INFO L280 TraceCheckUtils]: 16: Hoare triple {1041#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 2) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) (+ ULTIMATE.start_cstrspn_~p~0.offset ULTIMATE.start_main_~length1~0 (- 2)))))) (exists ((|ULTIMATE.start_cstrspn_#t~post4.base| Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| |ULTIMATE.start_cstrspn_#t~post4.base|) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= |ULTIMATE.start_cstrspn_#t~post4.base| ULTIMATE.start_cstrspn_~p~0.base)))))} assume cstrspn_~sc~0 == cstrspn_~c~0; {1041#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 2) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) (+ ULTIMATE.start_cstrspn_~p~0.offset ULTIMATE.start_main_~length1~0 (- 2)))))) (exists ((|ULTIMATE.start_cstrspn_#t~post4.base| Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| |ULTIMATE.start_cstrspn_#t~post4.base|) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= |ULTIMATE.start_cstrspn_#t~post4.base| ULTIMATE.start_cstrspn_~p~0.base)))))} is VALID [2020-07-29 03:26:40,834 INFO L280 TraceCheckUtils]: 17: Hoare triple {1041#(and (exists ((ULTIMATE.start_main_~length1~0 Int)) (and (< 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~length1~0 2) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrspn_~p~0.base) (+ ULTIMATE.start_cstrspn_~p~0.offset ULTIMATE.start_main_~length1~0 (- 2)))))) (exists ((|ULTIMATE.start_cstrspn_#t~post4.base| Int) (ULTIMATE.start_main_~length2~0 Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| |ULTIMATE.start_cstrspn_#t~post4.base|) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= |ULTIMATE.start_cstrspn_#t~post4.base| ULTIMATE.start_cstrspn_~p~0.base)))))} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; {988#(= 0 ULTIMATE.start_cstrspn_~c~0)} is VALID [2020-07-29 03:26:40,834 INFO L280 TraceCheckUtils]: 18: Hoare triple {988#(= 0 ULTIMATE.start_cstrspn_~c~0)} cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; {988#(= 0 ULTIMATE.start_cstrspn_~c~0)} is VALID [2020-07-29 03:26:40,835 INFO L280 TraceCheckUtils]: 19: Hoare triple {988#(= 0 ULTIMATE.start_cstrspn_~c~0)} assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; {1057#(and (= 0 ULTIMATE.start_cstrspn_~c~0) (not (= 0 ULTIMATE.start_cstrspn_~sc~0)))} is VALID [2020-07-29 03:26:40,836 INFO L280 TraceCheckUtils]: 20: Hoare triple {1057#(and (= 0 ULTIMATE.start_cstrspn_~c~0) (not (= 0 ULTIMATE.start_cstrspn_~sc~0)))} assume cstrspn_~sc~0 == cstrspn_~c~0; {981#false} is VALID [2020-07-29 03:26:40,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 03:26:40,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:26:40,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2020-07-29 03:26:40,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133273702] [2020-07-29 03:26:40,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:26:40,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-29 03:26:40,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2020-07-29 03:26:40,940 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand 18 states. [2020-07-29 03:26:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:26:42,520 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2020-07-29 03:26:42,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-29 03:26:42,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-29 03:26:42,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:42,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 52 transitions. [2020-07-29 03:26:42,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 03:26:42,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 52 transitions. [2020-07-29 03:26:42,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-07-29 03:26:42,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-07-29 03:26:42,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 52 transitions. [2020-07-29 03:26:42,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:42,597 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2020-07-29 03:26:42,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 52 transitions. [2020-07-29 03:26:42,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2020-07-29 03:26:42,602 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:42,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states and 52 transitions. Second operand 40 states. [2020-07-29 03:26:42,602 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states and 52 transitions. Second operand 40 states. [2020-07-29 03:26:42,602 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 40 states. [2020-07-29 03:26:42,603 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:42,606 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2020-07-29 03:26:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2020-07-29 03:26:42,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:42,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:42,607 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 43 states and 52 transitions. [2020-07-29 03:26:42,607 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 43 states and 52 transitions. [2020-07-29 03:26:42,608 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:42,610 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2020-07-29 03:26:42,610 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2020-07-29 03:26:42,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:42,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:42,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:42,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-29 03:26:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2020-07-29 03:26:42,613 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2020-07-29 03:26:42,613 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2020-07-29 03:26:42,613 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 03:26:42,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2020-07-29 03:26:42,614 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 03:26:42,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:42,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:42,614 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:42,614 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 03:26:42,614 INFO L794 eck$LassoCheckResult]: Stem: 1136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1131#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 1132#L528 assume !(main_~length1~0 < 1); 1121#L528-2 assume !(main_~length2~0 < 1); 1122#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 1125#L537-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1123#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 1124#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 1126#L537-4 main_~i~1 := 0; 1128#L541-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 1140#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 1141#L541-3 assume !(main_~i~1 < main_~length2~0 - 1); 1119#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 1120#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 1142#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 1138#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; 1139#L521 assume cstrspn_~sc~0 == cstrspn_~c~0; 1129#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 1130#L520-3 [2020-07-29 03:26:42,615 INFO L796 eck$LassoCheckResult]: Loop: 1130#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 1137#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; 1133#L521 assume !(cstrspn_~sc~0 == cstrspn_~c~0); 1130#L520-3 [2020-07-29 03:26:42,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:42,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1072640524, now seen corresponding path program 3 times [2020-07-29 03:26:42,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:42,615 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554506668] [2020-07-29 03:26:42,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,632 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,645 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,651 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:42,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:42,651 INFO L82 PathProgramCache]: Analyzing trace with hash 78613, now seen corresponding path program 2 times [2020-07-29 03:26:42,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:42,652 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064225945] [2020-07-29 03:26:42,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,655 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,659 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,661 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:42,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:42,661 INFO L82 PathProgramCache]: Analyzing trace with hash 477217066, now seen corresponding path program 1 times [2020-07-29 03:26:42,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:42,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105307673] [2020-07-29 03:26:42,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,691 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:42,715 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:42,728 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:44,019 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 199 DAG size of output: 162 [2020-07-29 03:26:44,437 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-07-29 03:26:44,440 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:44,441 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:44,441 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:44,441 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:44,441 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:44,441 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:44,441 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:44,441 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:44,442 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca-2.i_Iteration7_Lasso [2020-07-29 03:26:44,442 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:44,442 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:44,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:44,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,310 WARN L193 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 103 [2020-07-29 03:26:45,535 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2020-07-29 03:26:45,536 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:26:45,537 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:26:45,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:45,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:46,062 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-07-29 03:26:46,547 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-07-29 03:26:46,771 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-07-29 03:26:46,876 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-07-29 03:26:47,033 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:47,034 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:47,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:47,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:47,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:47,044 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:47,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,067 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:47,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:47,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:47,068 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:47,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:47,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:47,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:47,093 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:47,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,119 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:47,119 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:47,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:47,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:47,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:47,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:47,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:47,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:47,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:47,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:47,177 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:47,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:47,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:47,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:47,201 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:47,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:47,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:47,228 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:47,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:47,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:47,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:47,256 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:47,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:47,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:47,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:47,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:47,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:47,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:47,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:47,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:47,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:47,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:47,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:47,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,360 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:47,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:47,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:47,362 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:47,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:47,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:47,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:47,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:47,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:47,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:47,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:47,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:47,445 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:47,470 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:47,539 INFO L443 ModelExtractionUtils]: Simplification made 21 calls to the SMT solver. [2020-07-29 03:26:47,540 INFO L444 ModelExtractionUtils]: 6 out of 58 variables were initially zero. Simplification set additionally 49 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:47,542 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:47,543 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:47,543 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:47,544 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_4, ULTIMATE.start_cstrspn_~spanp~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_4 - 1*ULTIMATE.start_cstrspn_~spanp~0.offset Supporting invariants [] [2020-07-29 03:26:47,774 INFO L297 tatePredicateManager]: 40 out of 41 supporting invariants were superfluous and have been removed [2020-07-29 03:26:47,781 INFO L393 LassoCheck]: Loop: "cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5;" "assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5;" "assume !(cstrspn_~sc~0 == cstrspn_~c~0);" [2020-07-29 03:26:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,787 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:26:47,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:26:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:47,898 INFO L280 TraceCheckUtils]: 0: Hoare triple {1387#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1387#unseeded} is VALID [2020-07-29 03:26:47,899 INFO L280 TraceCheckUtils]: 1: Hoare triple {1387#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; {1387#unseeded} is VALID [2020-07-29 03:26:47,901 INFO L280 TraceCheckUtils]: 2: Hoare triple {1387#unseeded} assume !(main_~length1~0 < 1); {1387#unseeded} is VALID [2020-07-29 03:26:47,902 INFO L280 TraceCheckUtils]: 3: Hoare triple {1387#unseeded} assume !(main_~length2~0 < 1); {1387#unseeded} is VALID [2020-07-29 03:26:47,908 INFO L280 TraceCheckUtils]: 4: Hoare triple {1387#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; {1627#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:47,911 INFO L280 TraceCheckUtils]: 5: Hoare triple {1627#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; {1627#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:47,917 INFO L280 TraceCheckUtils]: 6: Hoare triple {1627#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {1627#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:47,919 INFO L280 TraceCheckUtils]: 7: Hoare triple {1627#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !(main_~i~0 < main_~length1~0 - 1); {1627#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:47,920 INFO L280 TraceCheckUtils]: 8: Hoare triple {1627#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} main_~i~1 := 0; {1627#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:47,921 INFO L280 TraceCheckUtils]: 9: Hoare triple {1627#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; {1627#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:47,922 INFO L280 TraceCheckUtils]: 10: Hoare triple {1627#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; {1627#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:47,924 INFO L280 TraceCheckUtils]: 11: Hoare triple {1627#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !(main_~i~1 < main_~length2~0 - 1); {1627#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:47,925 INFO L280 TraceCheckUtils]: 12: Hoare triple {1627#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; {1652#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} is VALID [2020-07-29 03:26:47,926 INFO L280 TraceCheckUtils]: 13: Hoare triple {1652#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; {1652#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} is VALID [2020-07-29 03:26:47,927 INFO L280 TraceCheckUtils]: 14: Hoare triple {1652#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; {1652#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} is VALID [2020-07-29 03:26:47,928 INFO L280 TraceCheckUtils]: 15: Hoare triple {1652#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; {1652#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} is VALID [2020-07-29 03:26:47,929 INFO L280 TraceCheckUtils]: 16: Hoare triple {1652#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} assume cstrspn_~sc~0 == cstrspn_~c~0; {1652#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} is VALID [2020-07-29 03:26:47,930 INFO L280 TraceCheckUtils]: 17: Hoare triple {1652#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; {1606#(and (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_cstrspn_~spanp~0.base) unseeded)} is VALID [2020-07-29 03:26:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,938 WARN L261 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 03:26:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:47,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:48,036 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#(and (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_cstrspn_~spanp~0.base) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) (* (- 1) ULTIMATE.start_cstrspn_~spanp~0.offset))))} cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; {1668#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) 1) (+ ULTIMATE.start_cstrspn_~spanp~0.offset oldRank0)) (<= 1 oldRank0) (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_cstrspn_~spanp~0.base))} is VALID [2020-07-29 03:26:48,042 INFO L280 TraceCheckUtils]: 1: Hoare triple {1668#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) 1) (+ ULTIMATE.start_cstrspn_~spanp~0.offset oldRank0)) (<= 1 oldRank0) (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_cstrspn_~spanp~0.base))} assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; {1668#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) 1) (+ ULTIMATE.start_cstrspn_~spanp~0.offset oldRank0)) (<= 1 oldRank0) (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_cstrspn_~spanp~0.base))} is VALID [2020-07-29 03:26:48,043 INFO L280 TraceCheckUtils]: 2: Hoare triple {1668#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) 1) (+ ULTIMATE.start_cstrspn_~spanp~0.offset oldRank0)) (<= 1 oldRank0) (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_cstrspn_~spanp~0.base))} assume !(cstrspn_~sc~0 == cstrspn_~c~0); {1609#(and (or unseeded (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) (* (- 1) ULTIMATE.start_cstrspn_~spanp~0.offset))) (>= oldRank0 0))) (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_cstrspn_~spanp~0.base))} is VALID [2020-07-29 03:26:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:48,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:26:48,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:48,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,064 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-07-29 03:26:48,064 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 16 Second operand 5 states. [2020-07-29 03:26:48,169 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 49 states and 58 transitions. Complement of second has 7 states. [2020-07-29 03:26:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:48,170 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:48,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. cyclomatic complexity: 16 [2020-07-29 03:26:48,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:48,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:48,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 03:26:48,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:48,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:48,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:48,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 58 transitions. [2020-07-29 03:26:48,172 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 03:26:48,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:48,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:48,172 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 49 transitions. cyclomatic complexity: 16 [2020-07-29 03:26:48,174 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 03:26:48,174 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 03:26:48,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:48,175 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:48,175 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 49 states and 58 transitions. cyclomatic complexity: 16 [2020-07-29 03:26:48,177 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 03:26:48,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 1 letters. [2020-07-29 03:26:48,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 03:26:48,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 1 letters. [2020-07-29 03:26:48,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 49 letters. Loop has 49 letters. [2020-07-29 03:26:48,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 49 letters. Loop has 49 letters. [2020-07-29 03:26:48,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 16 Stem has 49 letters. Loop has 49 letters. [2020-07-29 03:26:48,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 40 letters. Loop has 40 letters. [2020-07-29 03:26:48,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 40 letters. Loop has 40 letters. [2020-07-29 03:26:48,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 16 Stem has 40 letters. Loop has 40 letters. [2020-07-29 03:26:48,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:48,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:48,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:48,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:48,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:48,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 16 Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:48,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:48,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:48,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 16 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:48,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:48,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:48,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:48,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:48,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:48,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:48,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 1 letters. [2020-07-29 03:26:48,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 03:26:48,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 1 letters. [2020-07-29 03:26:48,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:48,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:48,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 16 Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:48,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:48,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:48,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 16 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:48,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 23 letters. Loop has 4 letters. [2020-07-29 03:26:48,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 23 letters. Loop has 4 letters. [2020-07-29 03:26:48,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 16 Stem has 23 letters. Loop has 4 letters. [2020-07-29 03:26:48,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:48,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:48,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 58 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:48,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,193 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:48,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 03:26:48,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-07-29 03:26:48,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,194 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:26:48,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:48,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:26:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:48,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:48,314 INFO L280 TraceCheckUtils]: 0: Hoare triple {1387#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1387#unseeded} is VALID [2020-07-29 03:26:48,315 INFO L280 TraceCheckUtils]: 1: Hoare triple {1387#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; {1387#unseeded} is VALID [2020-07-29 03:26:48,315 INFO L280 TraceCheckUtils]: 2: Hoare triple {1387#unseeded} assume !(main_~length1~0 < 1); {1387#unseeded} is VALID [2020-07-29 03:26:48,316 INFO L280 TraceCheckUtils]: 3: Hoare triple {1387#unseeded} assume !(main_~length2~0 < 1); {1387#unseeded} is VALID [2020-07-29 03:26:48,317 INFO L280 TraceCheckUtils]: 4: Hoare triple {1387#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; {1754#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:48,317 INFO L280 TraceCheckUtils]: 5: Hoare triple {1754#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; {1754#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:48,320 INFO L280 TraceCheckUtils]: 6: Hoare triple {1754#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {1754#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:48,321 INFO L280 TraceCheckUtils]: 7: Hoare triple {1754#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !(main_~i~0 < main_~length1~0 - 1); {1754#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:48,321 INFO L280 TraceCheckUtils]: 8: Hoare triple {1754#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} main_~i~1 := 0; {1754#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:48,322 INFO L280 TraceCheckUtils]: 9: Hoare triple {1754#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; {1754#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:48,322 INFO L280 TraceCheckUtils]: 10: Hoare triple {1754#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; {1754#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:48,323 INFO L280 TraceCheckUtils]: 11: Hoare triple {1754#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !(main_~i~1 < main_~length2~0 - 1); {1754#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:48,324 INFO L280 TraceCheckUtils]: 12: Hoare triple {1754#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; {1779#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} is VALID [2020-07-29 03:26:48,325 INFO L280 TraceCheckUtils]: 13: Hoare triple {1779#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; {1779#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} is VALID [2020-07-29 03:26:48,326 INFO L280 TraceCheckUtils]: 14: Hoare triple {1779#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; {1779#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} is VALID [2020-07-29 03:26:48,327 INFO L280 TraceCheckUtils]: 15: Hoare triple {1779#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; {1779#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} is VALID [2020-07-29 03:26:48,327 INFO L280 TraceCheckUtils]: 16: Hoare triple {1779#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} assume cstrspn_~sc~0 == cstrspn_~c~0; {1779#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} is VALID [2020-07-29 03:26:48,328 INFO L280 TraceCheckUtils]: 17: Hoare triple {1779#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; {1606#(and (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_cstrspn_~spanp~0.base) unseeded)} is VALID [2020-07-29 03:26:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:48,335 WARN L261 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 03:26:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:48,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:48,444 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#(and (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_cstrspn_~spanp~0.base) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) (* (- 1) ULTIMATE.start_cstrspn_~spanp~0.offset))))} cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; {1795#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) 1) (+ ULTIMATE.start_cstrspn_~spanp~0.offset oldRank0)) (<= 1 oldRank0) (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_cstrspn_~spanp~0.base))} is VALID [2020-07-29 03:26:48,445 INFO L280 TraceCheckUtils]: 1: Hoare triple {1795#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) 1) (+ ULTIMATE.start_cstrspn_~spanp~0.offset oldRank0)) (<= 1 oldRank0) (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_cstrspn_~spanp~0.base))} assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; {1795#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) 1) (+ ULTIMATE.start_cstrspn_~spanp~0.offset oldRank0)) (<= 1 oldRank0) (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_cstrspn_~spanp~0.base))} is VALID [2020-07-29 03:26:48,446 INFO L280 TraceCheckUtils]: 2: Hoare triple {1795#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) 1) (+ ULTIMATE.start_cstrspn_~spanp~0.offset oldRank0)) (<= 1 oldRank0) (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_cstrspn_~spanp~0.base))} assume !(cstrspn_~sc~0 == cstrspn_~c~0); {1609#(and (or unseeded (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) (* (- 1) ULTIMATE.start_cstrspn_~spanp~0.offset))) (>= oldRank0 0))) (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_cstrspn_~spanp~0.base))} is VALID [2020-07-29 03:26:48,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:48,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:26:48,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:48,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,467 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 2 loop predicates [2020-07-29 03:26:48,467 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 16 Second operand 5 states. [2020-07-29 03:26:48,589 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 49 states and 60 transitions. Complement of second has 7 states. [2020-07-29 03:26:48,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:48,590 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:48,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. cyclomatic complexity: 16 [2020-07-29 03:26:48,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:48,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:48,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 03:26:48,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:48,594 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:48,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:48,594 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 60 transitions. [2020-07-29 03:26:48,594 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 03:26:48,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:48,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:48,595 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 49 transitions. cyclomatic complexity: 16 [2020-07-29 03:26:48,596 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 03:26:48,596 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 03:26:48,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:48,597 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:48,597 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 49 states and 60 transitions. cyclomatic complexity: 18 [2020-07-29 03:26:48,598 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 03:26:48,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 60 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:48,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:48,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 60 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:48,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 60 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 49 letters. Loop has 49 letters. [2020-07-29 03:26:48,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 49 letters. Loop has 49 letters. [2020-07-29 03:26:48,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 60 transitions. cyclomatic complexity: 18 Stem has 49 letters. Loop has 49 letters. [2020-07-29 03:26:48,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 40 letters. Loop has 40 letters. [2020-07-29 03:26:48,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 40 letters. Loop has 40 letters. [2020-07-29 03:26:48,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 60 transitions. cyclomatic complexity: 18 Stem has 40 letters. Loop has 40 letters. [2020-07-29 03:26:48,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:48,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:48,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 60 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:48,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:48,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:48,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 60 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:48,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:48,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:48,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 60 transitions. cyclomatic complexity: 18 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:48,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 60 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:48,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:48,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 60 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:48,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:48,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:48,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 60 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:48,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 60 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 60 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:48,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:48,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 60 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 2 letters. [2020-07-29 03:26:48,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 60 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:48,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:48,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 60 transitions. cyclomatic complexity: 18 Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:48,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:48,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:48,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 60 transitions. cyclomatic complexity: 18 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:48,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 23 letters. Loop has 4 letters. [2020-07-29 03:26:48,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 23 letters. Loop has 4 letters. [2020-07-29 03:26:48,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 60 transitions. cyclomatic complexity: 18 Stem has 23 letters. Loop has 4 letters. [2020-07-29 03:26:48,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 60 transitions. cyclomatic complexity: 18 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:48,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 60 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:48,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:48,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 60 transitions. cyclomatic complexity: 18 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:48,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,615 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 03:26:48,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-07-29 03:26:48,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,617 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:26:48,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:48,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:26:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:48,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:48,748 INFO L280 TraceCheckUtils]: 0: Hoare triple {1387#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1387#unseeded} is VALID [2020-07-29 03:26:48,749 INFO L280 TraceCheckUtils]: 1: Hoare triple {1387#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; {1387#unseeded} is VALID [2020-07-29 03:26:48,751 INFO L280 TraceCheckUtils]: 2: Hoare triple {1387#unseeded} assume !(main_~length1~0 < 1); {1387#unseeded} is VALID [2020-07-29 03:26:48,752 INFO L280 TraceCheckUtils]: 3: Hoare triple {1387#unseeded} assume !(main_~length2~0 < 1); {1387#unseeded} is VALID [2020-07-29 03:26:48,753 INFO L280 TraceCheckUtils]: 4: Hoare triple {1387#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; {1881#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:48,754 INFO L280 TraceCheckUtils]: 5: Hoare triple {1881#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; {1881#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:48,754 INFO L280 TraceCheckUtils]: 6: Hoare triple {1881#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {1881#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:48,755 INFO L280 TraceCheckUtils]: 7: Hoare triple {1881#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !(main_~i~0 < main_~length1~0 - 1); {1881#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:48,755 INFO L280 TraceCheckUtils]: 8: Hoare triple {1881#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} main_~i~1 := 0; {1881#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:48,756 INFO L280 TraceCheckUtils]: 9: Hoare triple {1881#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; {1881#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:48,757 INFO L280 TraceCheckUtils]: 10: Hoare triple {1881#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; {1881#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:48,757 INFO L280 TraceCheckUtils]: 11: Hoare triple {1881#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} assume !(main_~i~1 < main_~length2~0 - 1); {1881#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} is VALID [2020-07-29 03:26:48,758 INFO L280 TraceCheckUtils]: 12: Hoare triple {1881#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc9.base|) unseeded)} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; {1906#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} is VALID [2020-07-29 03:26:48,758 INFO L280 TraceCheckUtils]: 13: Hoare triple {1906#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; {1906#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} is VALID [2020-07-29 03:26:48,759 INFO L280 TraceCheckUtils]: 14: Hoare triple {1906#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; {1906#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} is VALID [2020-07-29 03:26:48,760 INFO L280 TraceCheckUtils]: 15: Hoare triple {1906#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; {1906#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} is VALID [2020-07-29 03:26:48,761 INFO L280 TraceCheckUtils]: 16: Hoare triple {1906#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} assume cstrspn_~sc~0 == cstrspn_~c~0; {1906#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} is VALID [2020-07-29 03:26:48,761 INFO L280 TraceCheckUtils]: 17: Hoare triple {1906#(and unseeded (= ULTIMATE.start_cstrspn_~s2.base |ULTIMATE.start_main_#t~malloc9.base|))} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; {1606#(and (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_cstrspn_~spanp~0.base) unseeded)} is VALID [2020-07-29 03:26:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:48,767 WARN L261 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-29 03:26:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:48,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:48,871 INFO L280 TraceCheckUtils]: 0: Hoare triple {1607#(and (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_cstrspn_~spanp~0.base) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) (* (- 1) ULTIMATE.start_cstrspn_~spanp~0.offset))))} cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; {1922#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) 1) (+ ULTIMATE.start_cstrspn_~spanp~0.offset oldRank0)) (<= 1 oldRank0) (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_cstrspn_~spanp~0.base))} is VALID [2020-07-29 03:26:48,872 INFO L280 TraceCheckUtils]: 1: Hoare triple {1922#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) 1) (+ ULTIMATE.start_cstrspn_~spanp~0.offset oldRank0)) (<= 1 oldRank0) (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_cstrspn_~spanp~0.base))} assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; {1922#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) 1) (+ ULTIMATE.start_cstrspn_~spanp~0.offset oldRank0)) (<= 1 oldRank0) (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_cstrspn_~spanp~0.base))} is VALID [2020-07-29 03:26:48,874 INFO L280 TraceCheckUtils]: 2: Hoare triple {1922#(and (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) 1) (+ ULTIMATE.start_cstrspn_~spanp~0.offset oldRank0)) (<= 1 oldRank0) (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_cstrspn_~spanp~0.base))} assume !(cstrspn_~sc~0 == cstrspn_~c~0); {1609#(and (or unseeded (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) (* (- 1) ULTIMATE.start_cstrspn_~spanp~0.offset))) (>= oldRank0 0))) (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_cstrspn_~spanp~0.base))} is VALID [2020-07-29 03:26:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:48,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:26:48,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:48,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:48,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:48,899 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2020-07-29 03:26:48,899 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 16 Second operand 5 states. [2020-07-29 03:26:49,000 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 49 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 54 states and 64 transitions. Complement of second has 6 states. [2020-07-29 03:26:49,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:49,000 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:49,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. cyclomatic complexity: 16 [2020-07-29 03:26:49,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:49,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:49,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 03:26:49,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:49,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:49,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:49,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 64 transitions. [2020-07-29 03:26:49,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:26:49,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:49,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:49,004 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 49 transitions. cyclomatic complexity: 16 [2020-07-29 03:26:49,004 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 03:26:49,004 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 03:26:49,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:49,006 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:49,006 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 54 states and 64 transitions. cyclomatic complexity: 17 [2020-07-29 03:26:49,006 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:26:49,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:49,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:49,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 64 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:49,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 1 letters. [2020-07-29 03:26:49,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 03:26:49,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 64 transitions. cyclomatic complexity: 17 Stem has 3 letters. Loop has 1 letters. [2020-07-29 03:26:49,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:49,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:49,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 64 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:49,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 54 letters. Loop has 54 letters. [2020-07-29 03:26:49,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 54 letters. Loop has 54 letters. [2020-07-29 03:26:49,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 64 transitions. cyclomatic complexity: 17 Stem has 54 letters. Loop has 54 letters. [2020-07-29 03:26:49,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 40 letters. Loop has 40 letters. [2020-07-29 03:26:49,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 40 letters. Loop has 40 letters. [2020-07-29 03:26:49,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 64 transitions. cyclomatic complexity: 17 Stem has 40 letters. Loop has 40 letters. [2020-07-29 03:26:49,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:49,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:49,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 64 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:26:49,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:49,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:49,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 64 transitions. cyclomatic complexity: 17 Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:49,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:49,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:49,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 64 transitions. cyclomatic complexity: 17 Stem has 22 letters. Loop has 3 letters. [2020-07-29 03:26:49,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:49,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:49,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 64 transitions. cyclomatic complexity: 17 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:49,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:49,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:49,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 64 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:49,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:49,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:49,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 64 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 3 letters. [2020-07-29 03:26:49,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:49,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:49,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 64 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:49,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:49,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:49,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 64 transitions. cyclomatic complexity: 17 Stem has 20 letters. Loop has 3 letters. [2020-07-29 03:26:49,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 1 letters. [2020-07-29 03:26:49,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 03:26:49,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 64 transitions. cyclomatic complexity: 17 Stem has 3 letters. Loop has 1 letters. [2020-07-29 03:26:49,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 4 letters. [2020-07-29 03:26:49,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 4 letters. [2020-07-29 03:26:49,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 64 transitions. cyclomatic complexity: 17 Stem has 20 letters. Loop has 4 letters. [2020-07-29 03:26:49,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 49 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:49,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:49,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 64 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:49,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,024 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 03:26:49,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2020-07-29 03:26:49,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 18 letters. Loop has 3 letters. [2020-07-29 03:26:49,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 21 letters. Loop has 3 letters. [2020-07-29 03:26:49,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 18 letters. Loop has 6 letters. [2020-07-29 03:26:49,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:49,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 64 transitions. cyclomatic complexity: 17 [2020-07-29 03:26:49,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:26:49,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 27 states and 33 transitions. [2020-07-29 03:26:49,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 03:26:49,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 03:26:49,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 33 transitions. [2020-07-29 03:26:49,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:26:49,030 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-07-29 03:26:49,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 33 transitions. [2020-07-29 03:26:49,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2020-07-29 03:26:49,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:26:49,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 33 transitions. Second operand 21 states. [2020-07-29 03:26:49,035 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 33 transitions. Second operand 21 states. [2020-07-29 03:26:49,035 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 21 states. [2020-07-29 03:26:49,036 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:49,037 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2020-07-29 03:26:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2020-07-29 03:26:49,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:49,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:49,039 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 27 states and 33 transitions. [2020-07-29 03:26:49,039 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 27 states and 33 transitions. [2020-07-29 03:26:49,039 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:26:49,040 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2020-07-29 03:26:49,041 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2020-07-29 03:26:49,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:26:49,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:26:49,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:26:49,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:26:49,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-29 03:26:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2020-07-29 03:26:49,042 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2020-07-29 03:26:49,042 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2020-07-29 03:26:49,043 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 03:26:49,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2020-07-29 03:26:49,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 03:26:49,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:49,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:49,044 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:26:49,044 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:26:49,044 INFO L794 eck$LassoCheckResult]: Stem: 2011#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2006#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; 2007#L528 assume !(main_~length1~0 < 1); 1997#L528-2 assume !(main_~length2~0 < 1); 1998#L531-1 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; 2001#L537-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 1999#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 2000#L537-3 assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; 2002#L537-2 main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; 2015#L537-3 assume !(main_~i~0 < main_~length1~0 - 1); 2003#L537-4 main_~i~1 := 0; 2004#L541-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; 2013#L541-2 main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; 2014#L541-3 assume !(main_~i~1 < main_~length2~0 - 1); 1995#L541-4 call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; 1996#L522 [2020-07-29 03:26:49,044 INFO L796 eck$LassoCheckResult]: Loop: 1996#L522 cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; 2005#L520-3 cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; 2012#L520-1 assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; 2008#L521 assume cstrspn_~sc~0 == cstrspn_~c~0; 1996#L522 [2020-07-29 03:26:49,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:49,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1523394364, now seen corresponding path program 1 times [2020-07-29 03:26:49,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:49,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453692538] [2020-07-29 03:26:49,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:49,066 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:49,075 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:49,079 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:49,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:49,080 INFO L82 PathProgramCache]: Analyzing trace with hash 2312936, now seen corresponding path program 4 times [2020-07-29 03:26:49,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:49,080 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119154636] [2020-07-29 03:26:49,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:49,089 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:49,092 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:49,094 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:49,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:49,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1430543523, now seen corresponding path program 4 times [2020-07-29 03:26:49,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:26:49,096 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454737332] [2020-07-29 03:26:49,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:26:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:49,131 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:26:49,150 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:26:49,155 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:26:50,387 WARN L193 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 152 DAG size of output: 125 [2020-07-29 03:26:50,751 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-07-29 03:26:50,756 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:26:50,756 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:26:50,756 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:26:50,756 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:26:50,756 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:26:50,756 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:50,757 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:26:50,757 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:26:50,757 INFO L133 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrspn-alloca-2.i_Iteration8_Lasso [2020-07-29 03:26:50,757 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:26:50,757 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:26:50,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:50,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:50,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:50,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:50,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:50,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:50,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:50,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:50,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:50,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:50,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 03:26:50,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:50,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:50,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:51,332 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2020-07-29 03:26:51,480 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-07-29 03:26:51,483 WARN L257 bleTransFormulaUtils]: 3 quantified variables [2020-07-29 03:26:51,483 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:26:51,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:51,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:51,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:51,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:51,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:51,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:51,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:26:52,569 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:26:52,569 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:52,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:52,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:52,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:52,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:52,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:52,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:52,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:52,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:52,579 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:52,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:52,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:52,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:52,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:52,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:52,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:52,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:52,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:52,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:52,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:52,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:52,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:52,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:52,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:52,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:52,633 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:52,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:52,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:52,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 03:26:52,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:52,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:52,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:52,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:52,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:52,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:52,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:52,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:52,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:52,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:52,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:52,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:52,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:52,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:52,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:52,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:52,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:52,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:52,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:52,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:52,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:52,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:52,720 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:52,720 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:52,723 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:52,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:52,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:52,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:52,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:52,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:52,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:52,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:52,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:52,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:52,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:52,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:52,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:52,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:52,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:52,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:52,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:52,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:52,773 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:52,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:52,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:52,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:52,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:52,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:52,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:52,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:52,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:52,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:26:52,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:52,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:52,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:52,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:52,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:52,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:52,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:52,826 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:52,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:52,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:52,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:52,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:52,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:52,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:52,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:52,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:52,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:52,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:52,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:52,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:52,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:52,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:52,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:52,875 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:52,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:52,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:52,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:52,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:52,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:52,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:52,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:52,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:52,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:26:52,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:52,902 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:52,926 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:52,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:52,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:52,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:52,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:52,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:52,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:52,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:52,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:52,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:52,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:52,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:52,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:52,972 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:52,972 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:52,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:52,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:52,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:52,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:52,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:52,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:52,998 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:52,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:53,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:53,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:53,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:53,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:53,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:53,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:53,027 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:53,027 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:53,034 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:53,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:53,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:53,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:53,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:53,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:53,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:53,058 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:53,061 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:53,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:53,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:53,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:26:53,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:53,083 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 03:26:53,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:53,084 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 03:26:53,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:26:53,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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:53,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:26:53,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:26:53,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:26:53,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:26:53,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:26:53,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:26:53,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:26:53,132 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:26:53,151 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-07-29 03:26:53,151 INFO L444 ModelExtractionUtils]: 19 out of 31 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:26:53,153 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:26:53,155 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:26:53,155 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:26:53,155 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_5, ULTIMATE.start_cstrspn_~p~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_5 - 1*ULTIMATE.start_cstrspn_~p~0.offset Supporting invariants [] [2020-07-29 03:26:53,243 INFO L297 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2020-07-29 03:26:53,248 INFO L393 LassoCheck]: Loop: "cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset;" "cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5;" "assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5;" "assume cstrspn_~sc~0 == cstrspn_~c~0;" [2020-07-29 03:26:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:53,254 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:26:53,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:26:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:53,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 03:26:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:53,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:53,353 INFO L280 TraceCheckUtils]: 0: Hoare triple {2164#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2164#unseeded} is VALID [2020-07-29 03:26:53,354 INFO L280 TraceCheckUtils]: 1: Hoare triple {2164#unseeded} havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~0, main_#t~nondet13, main_#t~post12, main_~i~1, main_#t~ret14, 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~nondet6;havoc main_#t~nondet6;main_~length2~0 := main_#t~nondet7;havoc main_#t~nondet7; {2164#unseeded} is VALID [2020-07-29 03:26:53,355 INFO L280 TraceCheckUtils]: 2: Hoare triple {2164#unseeded} assume !(main_~length1~0 < 1); {2164#unseeded} is VALID [2020-07-29 03:26:53,356 INFO L280 TraceCheckUtils]: 3: Hoare triple {2164#unseeded} assume !(main_~length2~0 < 1); {2164#unseeded} is VALID [2020-07-29 03:26:53,357 INFO L280 TraceCheckUtils]: 4: Hoare triple {2164#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~0 := 0; {2269#(and unseeded (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} is VALID [2020-07-29 03:26:53,358 INFO L280 TraceCheckUtils]: 5: Hoare triple {2269#(and unseeded (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; {2269#(and unseeded (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} is VALID [2020-07-29 03:26:53,358 INFO L280 TraceCheckUtils]: 6: Hoare triple {2269#(and unseeded (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {2269#(and unseeded (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} is VALID [2020-07-29 03:26:53,359 INFO L280 TraceCheckUtils]: 7: Hoare triple {2269#(and unseeded (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet11, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet11; {2269#(and unseeded (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} is VALID [2020-07-29 03:26:53,359 INFO L280 TraceCheckUtils]: 8: Hoare triple {2269#(and unseeded (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} main_#t~post10 := main_~i~0;main_~i~0 := 1 + main_#t~post10;havoc main_#t~post10; {2269#(and unseeded (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} is VALID [2020-07-29 03:26:53,360 INFO L280 TraceCheckUtils]: 9: Hoare triple {2269#(and unseeded (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} assume !(main_~i~0 < main_~length1~0 - 1); {2269#(and unseeded (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} is VALID [2020-07-29 03:26:53,361 INFO L280 TraceCheckUtils]: 10: Hoare triple {2269#(and unseeded (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} main_~i~1 := 0; {2269#(and unseeded (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} is VALID [2020-07-29 03:26:53,362 INFO L280 TraceCheckUtils]: 11: Hoare triple {2269#(and unseeded (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet13, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet13; {2269#(and unseeded (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} is VALID [2020-07-29 03:26:53,363 INFO L280 TraceCheckUtils]: 12: Hoare triple {2269#(and unseeded (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} main_#t~post12 := main_~i~1;main_~i~1 := 1 + main_#t~post12;havoc main_#t~post12; {2269#(and unseeded (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} is VALID [2020-07-29 03:26:53,363 INFO L280 TraceCheckUtils]: 13: Hoare triple {2269#(and unseeded (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} assume !(main_~i~1 < main_~length2~0 - 1); {2269#(and unseeded (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} is VALID [2020-07-29 03:26:53,364 INFO L280 TraceCheckUtils]: 14: Hoare triple {2269#(and unseeded (= ULTIMATE.start_main_~nondetString1~0.base |ULTIMATE.start_main_#t~malloc8.base|))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length2~0 - 1), 1);cstrspn_#in~s1.base, cstrspn_#in~s1.offset, cstrspn_#in~s2.base, cstrspn_#in~s2.offset := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;havoc cstrspn_#res;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset, cstrspn_#t~mem3, cstrspn_#t~post4.base, cstrspn_#t~post4.offset, cstrspn_#t~mem5, cstrspn_~s1.base, cstrspn_~s1.offset, cstrspn_~s2.base, cstrspn_~s2.offset, cstrspn_~p~0.base, cstrspn_~p~0.offset, cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset, cstrspn_~c~0, cstrspn_~sc~0;cstrspn_~s1.base, cstrspn_~s1.offset := cstrspn_#in~s1.base, cstrspn_#in~s1.offset;cstrspn_~s2.base, cstrspn_~s2.offset := cstrspn_#in~s2.base, cstrspn_#in~s2.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_~s1.base, cstrspn_~s1.offset;havoc cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;havoc cstrspn_~c~0;havoc cstrspn_~sc~0; {2248#(and (= ULTIMATE.start_cstrspn_~p~0.base |ULTIMATE.start_main_#t~malloc8.base|) unseeded)} is VALID [2020-07-29 03:26:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:53,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 03:26:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:26:53,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:26:53,429 INFO L280 TraceCheckUtils]: 0: Hoare triple {2249#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) (* (- 1) ULTIMATE.start_cstrspn_~p~0.offset))) (= ULTIMATE.start_cstrspn_~p~0.base |ULTIMATE.start_main_#t~malloc8.base|))} cstrspn_#t~post2.base, cstrspn_#t~post2.offset := cstrspn_~p~0.base, cstrspn_~p~0.offset;cstrspn_~p~0.base, cstrspn_~p~0.offset := cstrspn_#t~post2.base, 1 + cstrspn_#t~post2.offset;call cstrspn_#t~mem3 := read~int(cstrspn_#t~post2.base, cstrspn_#t~post2.offset, 1);cstrspn_~c~0 := cstrspn_#t~mem3;havoc cstrspn_#t~mem3;havoc cstrspn_#t~post2.base, cstrspn_#t~post2.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_~s2.base, cstrspn_~s2.offset; {2300#(and (= ULTIMATE.start_cstrspn_~p~0.base |ULTIMATE.start_main_#t~malloc8.base|) (<= ULTIMATE.start_cstrspn_~p~0.offset (select |#length| ULTIMATE.start_cstrspn_~p~0.base)) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) 1) (+ ULTIMATE.start_cstrspn_~p~0.offset oldRank0)))} is VALID [2020-07-29 03:26:53,431 INFO L280 TraceCheckUtils]: 1: Hoare triple {2300#(and (= ULTIMATE.start_cstrspn_~p~0.base |ULTIMATE.start_main_#t~malloc8.base|) (<= ULTIMATE.start_cstrspn_~p~0.offset (select |#length| ULTIMATE.start_cstrspn_~p~0.base)) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) 1) (+ ULTIMATE.start_cstrspn_~p~0.offset oldRank0)))} cstrspn_#t~post4.base, cstrspn_#t~post4.offset := cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset;cstrspn_~spanp~0.base, cstrspn_~spanp~0.offset := cstrspn_#t~post4.base, 1 + cstrspn_#t~post4.offset;call cstrspn_#t~mem5 := read~int(cstrspn_#t~post4.base, cstrspn_#t~post4.offset, 1);cstrspn_~sc~0 := cstrspn_#t~mem5; {2300#(and (= ULTIMATE.start_cstrspn_~p~0.base |ULTIMATE.start_main_#t~malloc8.base|) (<= ULTIMATE.start_cstrspn_~p~0.offset (select |#length| ULTIMATE.start_cstrspn_~p~0.base)) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) 1) (+ ULTIMATE.start_cstrspn_~p~0.offset oldRank0)))} is VALID [2020-07-29 03:26:53,431 INFO L280 TraceCheckUtils]: 2: Hoare triple {2300#(and (= ULTIMATE.start_cstrspn_~p~0.base |ULTIMATE.start_main_#t~malloc8.base|) (<= ULTIMATE.start_cstrspn_~p~0.offset (select |#length| ULTIMATE.start_cstrspn_~p~0.base)) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) 1) (+ ULTIMATE.start_cstrspn_~p~0.offset oldRank0)))} assume !!(0 != cstrspn_~sc~0);havoc cstrspn_#t~post4.base, cstrspn_#t~post4.offset;havoc cstrspn_#t~mem5; {2300#(and (= ULTIMATE.start_cstrspn_~p~0.base |ULTIMATE.start_main_#t~malloc8.base|) (<= ULTIMATE.start_cstrspn_~p~0.offset (select |#length| ULTIMATE.start_cstrspn_~p~0.base)) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) 1) (+ ULTIMATE.start_cstrspn_~p~0.offset oldRank0)))} is VALID [2020-07-29 03:26:53,432 INFO L280 TraceCheckUtils]: 3: Hoare triple {2300#(and (= ULTIMATE.start_cstrspn_~p~0.base |ULTIMATE.start_main_#t~malloc8.base|) (<= ULTIMATE.start_cstrspn_~p~0.offset (select |#length| ULTIMATE.start_cstrspn_~p~0.base)) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) 1) (+ ULTIMATE.start_cstrspn_~p~0.offset oldRank0)))} assume cstrspn_~sc~0 == cstrspn_~c~0; {2251#(and (= ULTIMATE.start_cstrspn_~p~0.base |ULTIMATE.start_main_#t~malloc8.base|) (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) (* (- 1) ULTIMATE.start_cstrspn_~p~0.offset))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 03:26:53,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:26:53,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:26:53,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:26:53,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:26:53,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,450 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 03:26:53,450 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-07-29 03:26:53,511 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 28 states and 35 transitions. Complement of second has 5 states. [2020-07-29 03:26:53,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:26:53,511 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:53,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. cyclomatic complexity: 8 [2020-07-29 03:26:53,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:53,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:53,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:26:53,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:53,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:26:53,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:26:53,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2020-07-29 03:26:53,513 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:26:53,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:26:53,513 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 26 transitions. cyclomatic complexity: 8 [2020-07-29 03:26:53,514 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 03:26:53,514 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:26:53,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:26:53,514 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:26:53,515 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 35 transitions. cyclomatic complexity: 11 [2020-07-29 03:26:53,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. cyclomatic complexity: 11 [2020-07-29 03:26:53,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:26:53,515 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:26:53,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:26:53,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:26:53,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:26:53,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:53,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:53,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:53,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 28 letters. Loop has 28 letters. [2020-07-29 03:26:53,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 03:26:53,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 11 Stem has 28 letters. Loop has 28 letters. [2020-07-29 03:26:53,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:26:53,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:26:53,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 11 Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:26:53,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:53,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:53,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:26:53,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:26:53,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:26:53,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:26:53,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:26:53,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:26:53,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 11 Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:26:53,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:26:53,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:26:53,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:26:53,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:53,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:53,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:26:53,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,521 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:26:53,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:26:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2020-07-29 03:26:53,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:26:53,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:26:53,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 15 letters. Loop has 8 letters. [2020-07-29 03:26:53,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:26:53,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. cyclomatic complexity: 11 [2020-07-29 03:26:53,524 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:26:53,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2020-07-29 03:26:53,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:26:53,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:26:53,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:26:53,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:26:53,524 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:26:53,524 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:26:53,524 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:26:53,524 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 03:26:53,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:26:53,525 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:26:53,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:26:53,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:26:53 BoogieIcfgContainer [2020-07-29 03:26:53,531 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:26:53,532 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:26:53,532 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:26:53,532 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:26:53,532 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:26:28" (3/4) ... [2020-07-29 03:26:53,536 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:26:53,536 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:26:53,537 INFO L168 Benchmark]: Toolchain (without parser) took 26094.54 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 482.9 MB). Free memory was 962.9 MB in the beginning and 872.4 MB in the end (delta: 90.5 MB). Peak memory consumption was 573.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:53,538 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:53,538 INFO L168 Benchmark]: CACSL2BoogieTranslator took 576.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -134.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:53,538 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:53,539 INFO L168 Benchmark]: Boogie Preprocessor took 35.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:53,539 INFO L168 Benchmark]: RCFGBuilder took 553.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:53,539 INFO L168 Benchmark]: BuchiAutomizer took 24860.87 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 364.9 MB). Free memory was 1.1 GB in the beginning and 872.4 MB in the end (delta: 188.5 MB). Peak memory consumption was 553.4 MB. Max. memory is 11.5 GB. [2020-07-29 03:26:53,540 INFO L168 Benchmark]: Witness Printer took 4.32 ms. Allocated memory is still 1.5 GB. Free memory is still 872.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:26:53,542 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 576.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -134.7 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 553.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 24860.87 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 364.9 MB). Free memory was 1.1 GB in the beginning and 872.4 MB in the end (delta: 188.5 MB). Peak memory consumption was 553.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.32 ms. Allocated memory is still 1.5 GB. Free memory is still 872.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * nondetString1 + -1 * i + unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function -1 * i + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * nondetString2 and consists of 5 locations. One deterministic module has affine ranking function -1 * spanp + unknown-#length-unknown[spanp] and consists of 3 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length1 * sizeof(char))] + -1 * p and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] + -1 * spanp and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.8s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 19.6s. Construction of modules took 0.7s. Büchi inclusion checks took 4.1s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 14 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 40 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 156 SDtfs, 266 SDslu, 354 SDs, 0 SdLazy, 382 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital258 mio100 ax108 hnf98 lsp87 ukn72 mio100 lsp44 div100 bol100 ite100 ukn100 eq186 hnf87 smp96 dnf101 smp100 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...