./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/cstrcat-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/cstrcat-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 c15bd857267d499e7ecc6e455c2b5fbe7515d7da ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:25:22,169 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:25:22,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:25:22,188 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:25:22,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:25:22,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:25:22,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:25:22,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:25:22,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:25:22,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:25:22,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:25:22,202 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:25:22,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:25:22,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:25:22,205 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:25:22,207 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:25:22,208 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:25:22,209 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:25:22,212 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:25:22,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:25:22,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:25:22,217 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:25:22,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:25:22,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:25:22,223 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:25:22,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:25:22,224 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:25:22,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:25:22,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:25:22,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:25:22,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:25:22,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:25:22,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:25:22,231 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:25:22,232 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:25:22,233 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:25:22,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:25:22,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:25:22,234 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:25:22,236 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:25:22,237 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:25:22,238 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:25:22,256 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:25:22,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:25:22,258 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:25:22,258 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:25:22,259 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:25:22,259 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:25:22,259 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:25:22,259 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:25:22,260 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:25:22,260 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:25:22,260 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:25:22,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:25:22,261 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:25:22,261 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:25:22,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:25:22,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:25:22,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:25:22,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:25:22,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:25:22,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:25:22,263 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:25:22,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:25:22,264 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:25:22,264 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:25:22,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:25:22,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:25:22,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:25:22,265 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:25:22,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:25:22,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:25:22,266 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:25:22,267 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:25:22,268 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:25:22,268 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 -> c15bd857267d499e7ecc6e455c2b5fbe7515d7da [2020-07-29 03:25:22,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:25:22,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:25:22,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:25:22,640 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:25:22,640 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:25:22,641 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i [2020-07-29 03:25:22,717 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/877b2214b/6dfe86f7dce644beaf56395e73aafdf2/FLAG77770654a [2020-07-29 03:25:23,321 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:25:23,322 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcat-alloca-2.i [2020-07-29 03:25:23,345 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/877b2214b/6dfe86f7dce644beaf56395e73aafdf2/FLAG77770654a [2020-07-29 03:25:23,561 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/877b2214b/6dfe86f7dce644beaf56395e73aafdf2 [2020-07-29 03:25:23,564 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:25:23,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:25:23,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:23,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:25:23,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:25:23,575 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:23" (1/1) ... [2020-07-29 03:25:23,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46bbe886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:23, skipping insertion in model container [2020-07-29 03:25:23,578 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:23" (1/1) ... [2020-07-29 03:25:23,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:25:23,642 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:25:24,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:24,064 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:25:24,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:24,227 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:25:24,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:24 WrapperNode [2020-07-29 03:25:24,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:24,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:24,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:25:24,229 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:25:24,239 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:25:24" (1/1) ... [2020-07-29 03:25:24,256 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:25:24" (1/1) ... [2020-07-29 03:25:24,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:24,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:25:24,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:25:24,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:25:24,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:24" (1/1) ... [2020-07-29 03:25:24,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:24" (1/1) ... [2020-07-29 03:25:24,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:24" (1/1) ... [2020-07-29 03:25:24,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:24" (1/1) ... [2020-07-29 03:25:24,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:24" (1/1) ... [2020-07-29 03:25:24,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:24" (1/1) ... [2020-07-29 03:25:24,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:24" (1/1) ... [2020-07-29 03:25:24,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:25:24,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:25:24,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:25:24,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:25:24,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:24" (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:25:24,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:25:24,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:25:24,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:25:24,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:25:24,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:25:24,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:25:24,927 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:25:24,927 INFO L295 CfgBuilder]: Removed 10 assume(true) statements. [2020-07-29 03:25:24,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:24 BoogieIcfgContainer [2020-07-29 03:25:24,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:25:24,932 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:25:24,932 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:25:24,936 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:25:24,937 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:24,937 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:25:23" (1/3) ... [2020-07-29 03:25:24,939 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53189151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:24, skipping insertion in model container [2020-07-29 03:25:24,939 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:24,939 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:24" (2/3) ... [2020-07-29 03:25:24,940 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53189151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:24, skipping insertion in model container [2020-07-29 03:25:24,940 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:24,941 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:24" (3/3) ... [2020-07-29 03:25:24,943 INFO L371 chiAutomizerObserver]: Analyzing ICFG cstrcat-alloca-2.i [2020-07-29 03:25:25,004 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:25:25,005 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:25:25,005 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:25:25,005 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:25:25,005 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:25:25,006 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:25:25,006 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:25:25,006 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:25:25,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-07-29 03:25:25,049 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:25,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:25,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:25,056 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:25:25,057 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:25,057 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:25:25,057 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-07-29 03:25:25,062 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:25,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:25,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:25,063 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:25:25,063 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:25,069 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 10#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 23#L527true assume !(main_~length1~0 < 1); 7#L527-2true assume !(main_~length2~0 < 2); 19#L530-1true assume !(main_~length3~0 < 1); 11#L533-1true assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 5#L540-3true [2020-07-29 03:25:25,070 INFO L796 eck$LassoCheckResult]: Loop: 5#L540-3true assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet13, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet13; 22#L540-2true main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 5#L540-3true [2020-07-29 03:25:25,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:25,075 INFO L82 PathProgramCache]: Analyzing trace with hash 889572367, now seen corresponding path program 1 times [2020-07-29 03:25:25,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:25,087 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563295234] [2020-07-29 03:25:25,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:25,193 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:25,213 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:25,239 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:25,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:25,240 INFO L82 PathProgramCache]: Analyzing trace with hash 2019, now seen corresponding path program 1 times [2020-07-29 03:25:25,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:25,241 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506734950] [2020-07-29 03:25:25,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:25,253 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:25,261 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:25,264 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:25,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:25,267 INFO L82 PathProgramCache]: Analyzing trace with hash 180553841, now seen corresponding path program 1 times [2020-07-29 03:25:25,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:25,267 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661218679] [2020-07-29 03:25:25,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:25,313 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:25,360 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:25,370 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:25,659 WARN L193 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2020-07-29 03:25:25,797 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:25,797 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:25,798 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:25,798 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:25,798 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:25,798 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:25,799 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:25,799 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:25,799 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration1_Lasso [2020-07-29 03:25:25,799 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:25,800 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:25,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:25:25,889 INFO L141 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:25:25,894 INFO L141 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:25:25,905 INFO L141 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:25:25,915 INFO L141 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:25:25,920 INFO L141 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:25:25,936 INFO L141 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:25:25,942 INFO L141 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:25:25,949 INFO L141 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:25:25,956 INFO L141 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:25:26,140 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2020-07-29 03:25:26,190 INFO L141 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:25:26,194 INFO L141 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:25:26,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:26,204 INFO L141 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:25:26,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:26,216 INFO L141 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:25:26,223 INFO L141 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:25:26,935 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:26,941 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:26,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:26,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:26,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:26,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:26,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:26,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:26,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:26,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:26,957 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:25:26,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:26,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:26,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:26,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:26,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:26,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:26,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:26,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:27,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:27,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:27,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:27,047 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:27,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:27,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:27,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:27,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:27,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:27,053 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) [2020-07-29 03:25:27,091 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:27,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:27,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:27,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:27,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:27,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:27,098 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:27,102 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:25:27,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:27,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:27,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:27,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:27,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:27,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:27,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:27,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:27,147 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:27,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:27,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:27,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:27,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:27,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:27,197 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:27,198 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:27,202 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:27,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:27,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:27,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:27,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:27,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:27,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:27,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:27,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:27,255 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:25:27,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:27,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:27,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:27,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:27,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:27,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:27,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:27,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:27,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 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:25:27,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:27,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:27,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:27,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:27,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:27,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:27,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:27,358 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:25:27,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:27,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:27,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:27,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:27,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:27,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:27,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:27,404 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:25:27,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:27,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:27,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:27,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:27,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:27,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:27,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:27,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:27,440 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:25:27,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:27,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:27,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:27,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:27,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:27,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:27,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:27,474 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:25:27,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:27,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:27,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:27,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:27,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:27,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:27,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:27,519 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:27,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:27,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:27,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:27,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:27,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:27,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:27,548 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:27,553 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:25:27,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:27,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:27,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:27,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:27,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:27,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:27,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:27,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:27,616 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:27,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:27,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:27,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:27,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:27,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:27,693 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:27,696 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:27,712 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:27,759 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-07-29 03:25:27,759 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 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:25:27,767 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:27,771 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:27,771 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:27,772 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~length1~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-07-29 03:25:27,939 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:25:27,943 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet13, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet13;" "main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12;" [2020-07-29 03:25:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:27,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:27,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:28,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:28,021 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {31#unseeded} is VALID [2020-07-29 03:25:28,022 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; {31#unseeded} is VALID [2020-07-29 03:25:28,023 INFO L280 TraceCheckUtils]: 2: Hoare triple {31#unseeded} assume !(main_~length1~0 < 1); {31#unseeded} is VALID [2020-07-29 03:25:28,024 INFO L280 TraceCheckUtils]: 3: Hoare triple {31#unseeded} assume !(main_~length2~0 < 2); {31#unseeded} is VALID [2020-07-29 03:25:28,024 INFO L280 TraceCheckUtils]: 4: Hoare triple {31#unseeded} assume !(main_~length3~0 < 1); {31#unseeded} is VALID [2020-07-29 03:25:28,025 INFO L280 TraceCheckUtils]: 5: Hoare triple {31#unseeded} assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; {31#unseeded} is VALID [2020-07-29 03:25:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:28,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:25:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:28,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:28,055 INFO L280 TraceCheckUtils]: 0: Hoare triple {34#(>= oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_main_~i~0)))} assume !!(main_~i~0 < main_~length1~0 - 1);call write~int(main_#t~nondet13, main_~nondetString1~0.base, main_~nondetString1~0.offset + main_~i~0, 1);havoc main_#t~nondet13; {94#(and (<= ULTIMATE.start_main_~length1~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~length1~0))} is VALID [2020-07-29 03:25:28,057 INFO L280 TraceCheckUtils]: 1: Hoare triple {94#(and (<= ULTIMATE.start_main_~length1~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< (+ ULTIMATE.start_main_~i~0 1) ULTIMATE.start_main_~length1~0))} main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; {74#(or (and (> oldRank0 (+ ULTIMATE.start_main_~length1~0 (* (- 1) ULTIMATE.start_main_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:25:28,057 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:25:28,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:28,080 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:28,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:28,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,092 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:25:28,094 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states. Second operand 3 states. [2020-07-29 03:25:28,243 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states.. Second operand 3 states. Result 52 states and 74 transitions. Complement of second has 7 states. [2020-07-29 03:25:28,244 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:25:28,244 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:28,244 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-07-29 03:25:28,248 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:28,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:28,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:28,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:28,255 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:28,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:28,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:28,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 74 transitions. [2020-07-29 03:25:28,258 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:28,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:28,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:28,264 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states. [2020-07-29 03:25:28,268 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 03:25:28,276 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 03:25:28,277 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:28,285 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:28,286 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:28,288 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 52 states and 74 transitions. cyclomatic complexity: 32 [2020-07-29 03:25:28,291 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:25:28,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:28,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:28,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:28,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:28,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:28,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:28,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:28,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:28,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:28,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 52 letters. Loop has 52 letters. [2020-07-29 03:25:28,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 52 letters. [2020-07-29 03:25:28,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 52 letters. Loop has 52 letters. [2020-07-29 03:25:28,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:25:28,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:25:28,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 21 letters. [2020-07-29 03:25:28,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:28,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:28,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:28,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:28,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:28,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:28,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:28,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:28,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:28,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:28,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:28,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:28,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:28,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:28,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:28,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:28,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:28,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:28,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:28,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:28,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:28,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:28,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:28,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:28,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:28,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:28,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:28,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:28,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:28,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:28,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:28,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:28,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:28,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:28,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:28,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:28,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:28,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:28,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:28,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:28,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:28,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:28,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:28,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:28,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:28,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:28,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:28,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:28,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:28,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:28,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 52 states and 74 transitions. cyclomatic complexity: 32 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:28,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,337 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2020-07-29 03:25:28,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:28,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:28,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:25:28,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:28,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 74 transitions. cyclomatic complexity: 32 [2020-07-29 03:25:28,372 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:28,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 17 states and 24 transitions. [2020-07-29 03:25:28,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 03:25:28,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 03:25:28,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2020-07-29 03:25:28,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:28,387 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-07-29 03:25:28,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2020-07-29 03:25:28,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-29 03:25:28,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:28,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 24 transitions. Second operand 17 states. [2020-07-29 03:25:28,421 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 24 transitions. Second operand 17 states. [2020-07-29 03:25:28,425 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second operand 17 states. [2020-07-29 03:25:28,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:28,431 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2020-07-29 03:25:28,431 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2020-07-29 03:25:28,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:28,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:28,433 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states and 24 transitions. [2020-07-29 03:25:28,433 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states and 24 transitions. [2020-07-29 03:25:28,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:28,436 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2020-07-29 03:25:28,437 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2020-07-29 03:25:28,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:28,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:28,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:28,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:28,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 03:25:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2020-07-29 03:25:28,448 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-07-29 03:25:28,448 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-07-29 03:25:28,448 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:25:28,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2020-07-29 03:25:28,451 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:28,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:28,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:28,453 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:28,453 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:28,453 INFO L794 eck$LassoCheckResult]: Stem: 175#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 171#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 172#L527 assume !(main_~length1~0 < 1); 168#L527-2 assume !(main_~length2~0 < 2); 169#L530-1 assume !(main_~length3~0 < 1); 173#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 163#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 165#L540-4 main_~i~1 := 0; 167#L545-3 [2020-07-29 03:25:28,454 INFO L796 eck$LassoCheckResult]: Loop: 167#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 170#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 167#L545-3 [2020-07-29 03:25:28,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:28,455 INFO L82 PathProgramCache]: Analyzing trace with hash 180553783, now seen corresponding path program 1 times [2020-07-29 03:25:28,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:28,455 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128494183] [2020-07-29 03:25:28,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:28,500 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:28,521 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:28,529 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:28,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:28,532 INFO L82 PathProgramCache]: Analyzing trace with hash 2467, now seen corresponding path program 1 times [2020-07-29 03:25:28,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:28,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193058220] [2020-07-29 03:25:28,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:28,544 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:28,548 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:28,551 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:28,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:28,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1713495129, now seen corresponding path program 1 times [2020-07-29 03:25:28,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:28,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587565111] [2020-07-29 03:25:28,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:28,568 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:28,581 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:28,585 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:28,800 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2020-07-29 03:25:28,909 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:28,909 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:28,909 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:28,909 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:28,909 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:28,910 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:28,910 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:28,910 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:28,910 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration2_Lasso [2020-07-29 03:25:28,910 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:28,910 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:28,934 INFO L141 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:25:28,938 INFO L141 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:25:28,943 INFO L141 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:25:28,947 INFO L141 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:25:28,951 INFO L141 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:25:28,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:28,962 INFO L141 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:25:28,966 INFO L141 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:25:28,970 INFO L141 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:25:28,973 INFO L141 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:25:28,978 INFO L141 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:25:29,129 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2020-07-29 03:25:29,155 INFO L141 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:25:29,159 INFO L141 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:25:29,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:29,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:29,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:29,853 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:29,853 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) [2020-07-29 03:25:29,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:29,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:29,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:29,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:29,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:29,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:29,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:29,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:29,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 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:25:29,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:29,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:29,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:29,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:29,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:29,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:29,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:29,920 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:29,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:29,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:29,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:29,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:29,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:29,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:29,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:29,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:29,950 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:25:29,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:29,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:29,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:29,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:29,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:29,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:29,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:29,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:30,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:30,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:30,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:30,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:30,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:30,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:30,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:30,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:30,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:30,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:30,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:30,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:30,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:30,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:30,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:30,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:30,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:30,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:30,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:30,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:30,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:30,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:30,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:30,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:30,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:30,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:30,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:30,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:30,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:30,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:30,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:30,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:30,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:30,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:30,164 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:25:30,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:30,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:30,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:30,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:30,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:30,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:30,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:30,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:30,205 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:25:30,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:30,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:30,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:30,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:30,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:30,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:30,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:30,234 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) [2020-07-29 03:25:30,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:30,261 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:30,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:30,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:30,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:30,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:30,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:30,275 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) [2020-07-29 03:25:30,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:30,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:30,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:30,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:30,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:30,320 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:30,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:30,338 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:30,383 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-07-29 03:25:30,384 INFO L444 ModelExtractionUtils]: 8 out of 34 variables were initially zero. Simplification set additionally 21 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:30,386 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:30,388 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 03:25:30,388 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:30,389 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1, ULTIMATE.start_main_~i~1) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_main_~i~1 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0.base)_1 - 1*ULTIMATE.start_main_~length2~0 >= 0] [2020-07-29 03:25:30,440 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2020-07-29 03:25:30,446 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15;" "main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14;" [2020-07-29 03:25:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:30,452 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:25:30,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:30,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:25:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:30,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:30,562 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:25:30,563 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-29 03:25:30,564 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:25:30,584 INFO L624 ElimStorePlain]: treesize reduction 10, result has 61.5 percent of original size [2020-07-29 03:25:30,585 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:25:30,586 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:11, output treesize:7 [2020-07-29 03:25:30,588 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:25:30,589 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_55|, |ULTIMATE.start_main_#t~malloc10.base|, ULTIMATE.start_main_~length1~0]. (and (= |#length| (store (store |v_#length_55| |ULTIMATE.start_main_#t~malloc10.base| ULTIMATE.start_main_~length1~0) ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_main_~length2~0)) unseeded) [2020-07-29 03:25:30,589 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded) [2020-07-29 03:25:30,613 INFO L280 TraceCheckUtils]: 0: Hoare triple {220#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {220#unseeded} is VALID [2020-07-29 03:25:30,614 INFO L280 TraceCheckUtils]: 1: Hoare triple {220#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; {220#unseeded} is VALID [2020-07-29 03:25:30,615 INFO L280 TraceCheckUtils]: 2: Hoare triple {220#unseeded} assume !(main_~length1~0 < 1); {220#unseeded} is VALID [2020-07-29 03:25:30,615 INFO L280 TraceCheckUtils]: 3: Hoare triple {220#unseeded} assume !(main_~length2~0 < 2); {220#unseeded} is VALID [2020-07-29 03:25:30,616 INFO L280 TraceCheckUtils]: 4: Hoare triple {220#unseeded} assume !(main_~length3~0 < 1); {220#unseeded} is VALID [2020-07-29 03:25:30,618 INFO L280 TraceCheckUtils]: 5: Hoare triple {220#unseeded} assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; {293#(and (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 03:25:30,619 INFO L280 TraceCheckUtils]: 6: Hoare triple {293#(and (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} assume !(main_~i~0 < main_~length1~0 - 1); {293#(and (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} is VALID [2020-07-29 03:25:30,620 INFO L280 TraceCheckUtils]: 7: Hoare triple {293#(and (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0) unseeded)} main_~i~1 := 0; {269#(and (>= (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (* (- 1) ULTIMATE.start_main_~length2~0)) 0) unseeded)} is VALID [2020-07-29 03:25:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:30,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:25:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:30,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:30,663 INFO L280 TraceCheckUtils]: 0: Hoare triple {270#(and (>= (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (* (- 1) ULTIMATE.start_main_~length2~0)) 0) (>= oldRank0 (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (* (- 1) ULTIMATE.start_main_~i~1))))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; {300#(and (< (+ ULTIMATE.start_main_~i~1 1) ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~length2~0 (select |#length| ULTIMATE.start_main_~nondetString2~0.base)) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ oldRank0 ULTIMATE.start_main_~i~1)))} is VALID [2020-07-29 03:25:30,664 INFO L280 TraceCheckUtils]: 1: Hoare triple {300#(and (< (+ ULTIMATE.start_main_~i~1 1) ULTIMATE.start_main_~length2~0) (<= ULTIMATE.start_main_~length2~0 (select |#length| ULTIMATE.start_main_~nondetString2~0.base)) (<= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (+ oldRank0 ULTIMATE.start_main_~i~1)))} main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; {272#(and (>= (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (* (- 1) ULTIMATE.start_main_~length2~0)) 0) (or (and (> oldRank0 (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) (* (- 1) ULTIMATE.start_main_~i~1))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 03:25:30,665 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:25:30,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:25:30,679 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:30,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:30,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,680 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:25:30,680 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 03:25:30,825 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 24 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 24 states and 36 transitions. Complement of second has 7 states. [2020-07-29 03:25:30,825 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:25:30,825 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:30,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. cyclomatic complexity: 11 [2020-07-29 03:25:30,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:30,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:30,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:25:30,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:30,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:30,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:30,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 36 transitions. [2020-07-29 03:25:30,828 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:25:30,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:30,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:30,831 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 24 transitions. cyclomatic complexity: 11 [2020-07-29 03:25:30,833 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:25:30,836 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:25:30,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:30,838 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:30,838 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 36 transitions. cyclomatic complexity: 18 [2020-07-29 03:25:30,841 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:25:30,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:30,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:30,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:30,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:30,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:30,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:30,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:30,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:30,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:30,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:25:30,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:25:30,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:25:30,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:25:30,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:25:30,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:25:30,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:30,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:30,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:30,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:30,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:30,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:30,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:30,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:30,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:30,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:30,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:30,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:30,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:30,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:30,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:30,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:30,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:30,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:30,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:30,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:30,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:30,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:30,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:30,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:30,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:30,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:30,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:30,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:30,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:30,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:30,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:30,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:30,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:30,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:30,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:30,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:30,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,861 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:30,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:25:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2020-07-29 03:25:30,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:30,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:30,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:25:30,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:30,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 36 transitions. cyclomatic complexity: 18 [2020-07-29 03:25:30,871 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:25:30,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 18 states and 26 transitions. [2020-07-29 03:25:30,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 03:25:30,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 03:25:30,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2020-07-29 03:25:30,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:30,873 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-07-29 03:25:30,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2020-07-29 03:25:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-29 03:25:30,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:30,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 26 transitions. Second operand 18 states. [2020-07-29 03:25:30,875 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 26 transitions. Second operand 18 states. [2020-07-29 03:25:30,876 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand 18 states. [2020-07-29 03:25:30,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:30,877 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2020-07-29 03:25:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2020-07-29 03:25:30,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:30,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:30,878 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states and 26 transitions. [2020-07-29 03:25:30,878 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states and 26 transitions. [2020-07-29 03:25:30,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:30,883 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2020-07-29 03:25:30,884 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2020-07-29 03:25:30,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:30,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:30,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:30,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:30,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 03:25:30,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2020-07-29 03:25:30,886 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-07-29 03:25:30,886 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2020-07-29 03:25:30,886 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:25:30,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2020-07-29 03:25:30,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:25:30,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:30,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:30,887 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:30,887 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:30,887 INFO L794 eck$LassoCheckResult]: Stem: 356#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 352#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 353#L527 assume !(main_~length1~0 < 1); 348#L527-2 assume !(main_~length2~0 < 2); 349#L530-1 assume !(main_~length3~0 < 1); 354#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 343#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 345#L540-4 main_~i~1 := 0; 347#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 355#L545-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_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 342#L517-3 [2020-07-29 03:25:30,888 INFO L796 eck$LassoCheckResult]: Loop: 342#L517-3 call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); 340#L517-1 assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; 342#L517-3 [2020-07-29 03:25:30,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:30,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1713495071, now seen corresponding path program 1 times [2020-07-29 03:25:30,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:30,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058434677] [2020-07-29 03:25:30,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:31,026 INFO L280 TraceCheckUtils]: 0: Hoare triple {397#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {397#true} is VALID [2020-07-29 03:25:31,027 INFO L280 TraceCheckUtils]: 1: Hoare triple {397#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; {397#true} is VALID [2020-07-29 03:25:31,027 INFO L280 TraceCheckUtils]: 2: Hoare triple {397#true} assume !(main_~length1~0 < 1); {397#true} is VALID [2020-07-29 03:25:31,028 INFO L280 TraceCheckUtils]: 3: Hoare triple {397#true} assume !(main_~length2~0 < 2); {399#(<= 2 ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:25:31,029 INFO L280 TraceCheckUtils]: 4: Hoare triple {399#(<= 2 ULTIMATE.start_main_~length2~0)} assume !(main_~length3~0 < 1); {399#(<= 2 ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:25:31,036 INFO L280 TraceCheckUtils]: 5: Hoare triple {399#(<= 2 ULTIMATE.start_main_~length2~0)} assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; {399#(<= 2 ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:25:31,036 INFO L280 TraceCheckUtils]: 6: Hoare triple {399#(<= 2 ULTIMATE.start_main_~length2~0)} assume !(main_~i~0 < main_~length1~0 - 1); {399#(<= 2 ULTIMATE.start_main_~length2~0)} is VALID [2020-07-29 03:25:31,037 INFO L280 TraceCheckUtils]: 7: Hoare triple {399#(<= 2 ULTIMATE.start_main_~length2~0)} main_~i~1 := 0; {400#(and (<= 2 ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~i~1))} is VALID [2020-07-29 03:25:31,038 INFO L280 TraceCheckUtils]: 8: Hoare triple {400#(and (<= 2 ULTIMATE.start_main_~length2~0) (= 0 ULTIMATE.start_main_~i~1))} assume !(main_~i~1 < main_~length2~0 - 1); {398#false} is VALID [2020-07-29 03:25:31,038 INFO L280 TraceCheckUtils]: 9: Hoare triple {398#false} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; {398#false} is VALID [2020-07-29 03:25:31,039 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:25:31,039 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058434677] [2020-07-29 03:25:31,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:31,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:25:31,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184872454] [2020-07-29 03:25:31,042 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:31,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:31,043 INFO L82 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 1 times [2020-07-29 03:25:31,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:31,043 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885905211] [2020-07-29 03:25:31,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:31,048 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:31,050 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:31,052 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:31,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:31,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:25:31,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:25:31,097 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. cyclomatic complexity: 12 Second operand 4 states. [2020-07-29 03:25:31,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:31,177 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-07-29 03:25:31,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:25:31,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:25:31,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:31,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2020-07-29 03:25:31,202 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:25:31,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2020-07-29 03:25:31,203 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 03:25:31,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 03:25:31,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2020-07-29 03:25:31,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:31,204 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-07-29 03:25:31,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2020-07-29 03:25:31,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-07-29 03:25:31,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:31,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 26 transitions. Second operand 18 states. [2020-07-29 03:25:31,206 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 26 transitions. Second operand 18 states. [2020-07-29 03:25:31,206 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 18 states. [2020-07-29 03:25:31,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:31,207 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-07-29 03:25:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2020-07-29 03:25:31,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:31,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:31,208 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 19 states and 26 transitions. [2020-07-29 03:25:31,208 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 19 states and 26 transitions. [2020-07-29 03:25:31,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:31,210 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-07-29 03:25:31,210 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2020-07-29 03:25:31,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:31,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:31,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:31,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 03:25:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2020-07-29 03:25:31,212 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 03:25:31,212 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-07-29 03:25:31,212 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:25:31,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2020-07-29 03:25:31,213 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:25:31,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:31,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:31,214 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:31,214 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:31,214 INFO L794 eck$LassoCheckResult]: Stem: 438#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 434#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 435#L527 assume !(main_~length1~0 < 1); 430#L527-2 assume !(main_~length2~0 < 2); 431#L530-1 assume !(main_~length3~0 < 1); 436#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 425#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 427#L540-4 main_~i~1 := 0; 429#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 432#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 433#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 437#L545-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_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 424#L517-3 [2020-07-29 03:25:31,215 INFO L796 eck$LassoCheckResult]: Loop: 424#L517-3 call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); 422#L517-1 assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; 424#L517-3 [2020-07-29 03:25:31,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:31,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1696346049, now seen corresponding path program 1 times [2020-07-29 03:25:31,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:31,216 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974778350] [2020-07-29 03:25:31,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:31,233 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:31,248 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:31,253 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:31,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:31,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 2 times [2020-07-29 03:25:31,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:31,255 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215438713] [2020-07-29 03:25:31,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:31,264 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:31,267 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:31,269 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:31,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:31,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1899017530, now seen corresponding path program 1 times [2020-07-29 03:25:31,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:31,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507978559] [2020-07-29 03:25:31,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:31,629 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {485#true} is VALID [2020-07-29 03:25:31,629 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; {485#true} is VALID [2020-07-29 03:25:31,631 INFO L280 TraceCheckUtils]: 2: Hoare triple {485#true} assume !(main_~length1~0 < 1); {487#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:25:31,631 INFO L280 TraceCheckUtils]: 3: Hoare triple {487#(<= 1 ULTIMATE.start_main_~length1~0)} assume !(main_~length2~0 < 2); {487#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:25:31,635 INFO L280 TraceCheckUtils]: 4: Hoare triple {487#(<= 1 ULTIMATE.start_main_~length1~0)} assume !(main_~length3~0 < 1); {488#(and (<= 1 ULTIMATE.start_main_~length3~0) (<= 1 ULTIMATE.start_main_~length1~0))} is VALID [2020-07-29 03:25:31,637 INFO L280 TraceCheckUtils]: 5: Hoare triple {488#(and (<= 1 ULTIMATE.start_main_~length3~0) (<= 1 ULTIMATE.start_main_~length1~0))} assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; {489#(and (< 0 (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset)) (or (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset) 1) (<= (+ ULTIMATE.start_main_~length3~0 1) ULTIMATE.start_main_~length2~0)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:31,638 INFO L280 TraceCheckUtils]: 6: Hoare triple {489#(and (< 0 (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset)) (or (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset) 1) (<= (+ ULTIMATE.start_main_~length3~0 1) ULTIMATE.start_main_~length2~0)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~0 < main_~length1~0 - 1); {489#(and (< 0 (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset)) (or (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset) 1) (<= (+ ULTIMATE.start_main_~length3~0 1) ULTIMATE.start_main_~length2~0)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:31,639 INFO L280 TraceCheckUtils]: 7: Hoare triple {489#(and (< 0 (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset)) (or (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset) 1) (<= (+ ULTIMATE.start_main_~length3~0 1) ULTIMATE.start_main_~length2~0)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_~i~1 := 0; {490#(and (< 0 (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~i~1) (or (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset) 1) (<= (+ ULTIMATE.start_main_~length3~0 1) ULTIMATE.start_main_~length2~0)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:31,639 INFO L280 TraceCheckUtils]: 8: Hoare triple {490#(and (< 0 (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~i~1) (or (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset) 1) (<= (+ ULTIMATE.start_main_~length3~0 1) ULTIMATE.start_main_~length2~0)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; {490#(and (< 0 (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~i~1) (or (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset) 1) (<= (+ ULTIMATE.start_main_~length3~0 1) ULTIMATE.start_main_~length2~0)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:31,640 INFO L280 TraceCheckUtils]: 9: Hoare triple {490#(and (< 0 (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset)) (= 0 ULTIMATE.start_main_~i~1) (or (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset) 1) (<= (+ ULTIMATE.start_main_~length3~0 1) ULTIMATE.start_main_~length2~0)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; {491#(and (< 0 (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset)) (or (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~i~1) ULTIMATE.start_main_~length2~0) (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset) 1)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:31,641 INFO L280 TraceCheckUtils]: 10: Hoare triple {491#(and (< 0 (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset)) (or (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~i~1) ULTIMATE.start_main_~length2~0) (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset) 1)) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} assume !(main_~i~1 < main_~length2~0 - 1); {492#(and (< 0 (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset)) (<= ULTIMATE.start_main_~length3~0 1) (= 0 ULTIMATE.start_main_~nondetString2~0.offset))} is VALID [2020-07-29 03:25:31,643 INFO L280 TraceCheckUtils]: 11: Hoare triple {492#(and (< 0 (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset)) (<= ULTIMATE.start_main_~length3~0 1) (= 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_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; {493#(= (select (select |#memory_int| ULTIMATE.start_cstrcat_~s~0.base) ULTIMATE.start_cstrcat_~s~0.offset) 0)} is VALID [2020-07-29 03:25:31,644 INFO L280 TraceCheckUtils]: 12: Hoare triple {493#(= (select (select |#memory_int| ULTIMATE.start_cstrcat_~s~0.base) ULTIMATE.start_cstrcat_~s~0.offset) 0)} call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); {494#(= 0 |ULTIMATE.start_cstrcat_#t~mem2|)} is VALID [2020-07-29 03:25:31,644 INFO L280 TraceCheckUtils]: 13: Hoare triple {494#(= 0 |ULTIMATE.start_cstrcat_#t~mem2|)} assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; {486#false} is VALID [2020-07-29 03:25:31,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:31,645 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507978559] [2020-07-29 03:25:31,646 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957889711] [2020-07-29 03:25:31,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:31,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 24 conjunts are in the unsatisfiable core [2020-07-29 03:25:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:31,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:32,710 WARN L193 SmtUtils]: Spent 550.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-07-29 03:25:32,857 INFO L350 Elim1Store]: treesize reduction 40, result has 20.0 percent of original size [2020-07-29 03:25:32,858 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 21 [2020-07-29 03:25:32,858 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:25:32,877 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:25:32,979 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-07-29 03:25:32,979 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:54, output treesize:38 [2020-07-29 03:25:32,990 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:25:32,991 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_34|, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~length3~0, ULTIMATE.start_main_~nondetString2~0.offset]. (and (<= 1 ULTIMATE.start_main_~length3~0) (<= ULTIMATE.start_cstrcat_~s~0.offset ULTIMATE.start_main_~nondetString2~0.offset) (<= 1 ULTIMATE.start_main_~length1~0) (= (let ((.cse0 (store |v_#memory_int_34| ULTIMATE.start_main_~nondetString1~0.base (store (select |v_#memory_int_34| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1)) 0)))) (store .cse0 ULTIMATE.start_cstrcat_~s~0.base (store (select .cse0 ULTIMATE.start_cstrcat_~s~0.base) (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0))) |#memory_int|) (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~length1~0) 2) (<= ULTIMATE.start_main_~nondetString2~0.offset 0)) [2020-07-29 03:25:32,991 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~length3~0, ULTIMATE.start_main_~nondetString2~0.offset]. (and (<= 1 ULTIMATE.start_main_~length3~0) (<= ULTIMATE.start_cstrcat_~s~0.offset ULTIMATE.start_main_~nondetString2~0.offset) (<= 1 ULTIMATE.start_main_~length1~0) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1)))) (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~length1~0) 2) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcat_~s~0.base) (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= ULTIMATE.start_main_~nondetString2~0.offset 0)) [2020-07-29 03:25:33,710 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-29 03:25:33,756 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:25:33,757 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2020-07-29 03:25:33,759 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:25:33,771 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:25:33,830 INFO L544 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:25:33,832 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:48, output treesize:3 [2020-07-29 03:25:33,836 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:25:33,837 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, ULTIMATE.start_cstrcat_~s~0.base, ULTIMATE.start_cstrcat_~s~0.offset, ULTIMATE.start_main_~length3~0, ULTIMATE.start_main_~length1~0, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_~nondetString1~0.offset]. (let ((.cse0 (select |#memory_int| ULTIMATE.start_cstrcat_~s~0.base))) (and (<= 1 ULTIMATE.start_main_~length3~0) (= (select .cse0 ULTIMATE.start_cstrcat_~s~0.offset) |ULTIMATE.start_cstrcat_#t~mem2|) (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrcat_~s~0.offset ULTIMATE.start_main_~nondetString2~0.offset) (<= 0 ULTIMATE.start_cstrcat_~s~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1)))) (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~length1~0) 2) (= 0 (select .cse0 (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))) [2020-07-29 03:25:33,837 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= 0 |ULTIMATE.start_cstrcat_#t~mem2|) [2020-07-29 03:25:33,837 INFO L280 TraceCheckUtils]: 0: Hoare triple {485#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {485#true} is VALID [2020-07-29 03:25:33,837 INFO L280 TraceCheckUtils]: 1: Hoare triple {485#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; {485#true} is VALID [2020-07-29 03:25:33,840 INFO L280 TraceCheckUtils]: 2: Hoare triple {485#true} assume !(main_~length1~0 < 1); {487#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:25:33,840 INFO L280 TraceCheckUtils]: 3: Hoare triple {487#(<= 1 ULTIMATE.start_main_~length1~0)} assume !(main_~length2~0 < 2); {487#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:25:33,841 INFO L280 TraceCheckUtils]: 4: Hoare triple {487#(<= 1 ULTIMATE.start_main_~length1~0)} assume !(main_~length3~0 < 1); {488#(and (<= 1 ULTIMATE.start_main_~length3~0) (<= 1 ULTIMATE.start_main_~length1~0))} is VALID [2020-07-29 03:25:33,842 INFO L280 TraceCheckUtils]: 5: Hoare triple {488#(and (<= 1 ULTIMATE.start_main_~length3~0) (<= 1 ULTIMATE.start_main_~length1~0))} assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; {513#(and (<= 1 ULTIMATE.start_main_~length3~0) (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~length1~0) ULTIMATE.start_main_~length2~0) (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} is VALID [2020-07-29 03:25:33,843 INFO L280 TraceCheckUtils]: 6: Hoare triple {513#(and (<= 1 ULTIMATE.start_main_~length3~0) (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~length1~0) ULTIMATE.start_main_~length2~0) (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} assume !(main_~i~0 < main_~length1~0 - 1); {513#(and (<= 1 ULTIMATE.start_main_~length3~0) (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~length1~0) ULTIMATE.start_main_~length2~0) (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} is VALID [2020-07-29 03:25:33,844 INFO L280 TraceCheckUtils]: 7: Hoare triple {513#(and (<= 1 ULTIMATE.start_main_~length3~0) (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~length1~0) ULTIMATE.start_main_~length2~0) (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} main_~i~1 := 0; {520#(and (<= ULTIMATE.start_main_~i~1 0) (<= 1 ULTIMATE.start_main_~length3~0) (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~length1~0) ULTIMATE.start_main_~length2~0) (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} is VALID [2020-07-29 03:25:33,845 INFO L280 TraceCheckUtils]: 8: Hoare triple {520#(and (<= ULTIMATE.start_main_~i~1 0) (<= 1 ULTIMATE.start_main_~length3~0) (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~length1~0) ULTIMATE.start_main_~length2~0) (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; {520#(and (<= ULTIMATE.start_main_~i~1 0) (<= 1 ULTIMATE.start_main_~length3~0) (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~length1~0) ULTIMATE.start_main_~length2~0) (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} is VALID [2020-07-29 03:25:33,846 INFO L280 TraceCheckUtils]: 9: Hoare triple {520#(and (<= ULTIMATE.start_main_~i~1 0) (<= 1 ULTIMATE.start_main_~length3~0) (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~length1~0) ULTIMATE.start_main_~length2~0) (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; {527#(and (<= 1 ULTIMATE.start_main_~length3~0) (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~length1~0) ULTIMATE.start_main_~length2~0) (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~1 1) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} is VALID [2020-07-29 03:25:33,851 INFO L280 TraceCheckUtils]: 10: Hoare triple {527#(and (<= 1 ULTIMATE.start_main_~length3~0) (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~length1~0) ULTIMATE.start_main_~length2~0) (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_main_~i~1 1) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} assume !(main_~i~1 < main_~length2~0 - 1); {531#(and (<= 1 ULTIMATE.start_main_~length3~0) (<= 1 ULTIMATE.start_main_~length1~0) (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~length1~0) 2) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} is VALID [2020-07-29 03:25:33,857 INFO L280 TraceCheckUtils]: 11: Hoare triple {531#(and (<= 1 ULTIMATE.start_main_~length3~0) (<= 1 ULTIMATE.start_main_~length1~0) (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~length1~0) 2) (<= ULTIMATE.start_main_~nondetString2~0.offset 0))} call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~length1~0 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; {535#(exists ((ULTIMATE.start_main_~nondetString1~0.offset Int) (ULTIMATE.start_main_~length3~0 Int) (ULTIMATE.start_main_~nondetString1~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int) (ULTIMATE.start_main_~length1~0 Int)) (and (<= 1 ULTIMATE.start_main_~length3~0) (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrcat_~s~0.offset ULTIMATE.start_main_~nondetString2~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1)))) (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~length1~0) 2) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcat_~s~0.base) (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= ULTIMATE.start_main_~nondetString2~0.offset 0)))} is VALID [2020-07-29 03:25:33,864 INFO L280 TraceCheckUtils]: 12: Hoare triple {535#(exists ((ULTIMATE.start_main_~nondetString1~0.offset Int) (ULTIMATE.start_main_~length3~0 Int) (ULTIMATE.start_main_~nondetString1~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int) (ULTIMATE.start_main_~length1~0 Int)) (and (<= 1 ULTIMATE.start_main_~length3~0) (<= 1 ULTIMATE.start_main_~length1~0) (<= ULTIMATE.start_cstrcat_~s~0.offset ULTIMATE.start_main_~nondetString2~0.offset) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0 (- 1)))) (<= (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~length1~0) 2) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrcat_~s~0.base) (+ ULTIMATE.start_main_~length3~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= ULTIMATE.start_main_~nondetString2~0.offset 0)))} call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); {494#(= 0 |ULTIMATE.start_cstrcat_#t~mem2|)} is VALID [2020-07-29 03:25:33,869 INFO L280 TraceCheckUtils]: 13: Hoare triple {494#(= 0 |ULTIMATE.start_cstrcat_#t~mem2|)} assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; {486#false} is VALID [2020-07-29 03:25:33,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:33,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:33,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2020-07-29 03:25:33,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131047703] [2020-07-29 03:25:33,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:33,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-29 03:25:33,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2020-07-29 03:25:33,907 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. cyclomatic complexity: 11 Second operand 15 states. [2020-07-29 03:25:34,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:34,849 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2020-07-29 03:25:34,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 03:25:34,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-29 03:25:34,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:34,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2020-07-29 03:25:34,900 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:34,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 35 transitions. [2020-07-29 03:25:34,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-07-29 03:25:34,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-29 03:25:34,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2020-07-29 03:25:34,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:34,902 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-07-29 03:25:34,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2020-07-29 03:25:34,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2020-07-29 03:25:34,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:34,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 35 transitions. Second operand 23 states. [2020-07-29 03:25:34,904 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 35 transitions. Second operand 23 states. [2020-07-29 03:25:34,904 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 23 states. [2020-07-29 03:25:34,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:34,906 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2020-07-29 03:25:34,906 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-07-29 03:25:34,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:34,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:34,906 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 27 states and 35 transitions. [2020-07-29 03:25:34,906 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 27 states and 35 transitions. [2020-07-29 03:25:34,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:34,908 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2020-07-29 03:25:34,908 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-07-29 03:25:34,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:34,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:34,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:34,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:34,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 03:25:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2020-07-29 03:25:34,909 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-07-29 03:25:34,910 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-07-29 03:25:34,910 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:25:34,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2020-07-29 03:25:34,910 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 03:25:34,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:34,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:34,911 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:34,911 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:34,911 INFO L794 eck$LassoCheckResult]: Stem: 596#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 591#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 592#L527 assume !(main_~length1~0 < 1); 585#L527-2 assume !(main_~length2~0 < 2); 586#L530-1 assume !(main_~length3~0 < 1); 593#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 580#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 582#L540-4 main_~i~1 := 0; 584#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 589#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 590#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 594#L545-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_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 599#L517-3 call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); 578#L517-1 assume !(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2; 579#L519-2 [2020-07-29 03:25:34,911 INFO L796 eck$LassoCheckResult]: Loop: 579#L519-2 cstrcat_#t~post4.base, cstrcat_#t~post4.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post4.base, 1 + cstrcat_#t~post4.offset;cstrcat_#t~post5.base, cstrcat_#t~post5.offset := cstrcat_~s2.base, cstrcat_~s2.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#t~post5.base, 1 + cstrcat_#t~post5.offset;call cstrcat_#t~mem6 := read~int(cstrcat_#t~post5.base, cstrcat_#t~post5.offset, 1);call write~int(cstrcat_#t~mem6, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, 1); 598#L519 assume !!(0 != cstrcat_#t~mem6);havoc cstrcat_#t~post4.base, cstrcat_#t~post4.offset;havoc cstrcat_#t~post5.base, cstrcat_#t~post5.offset;havoc cstrcat_#t~mem6; 579#L519-2 [2020-07-29 03:25:34,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:34,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1899017532, now seen corresponding path program 1 times [2020-07-29 03:25:34,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:34,912 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722023290] [2020-07-29 03:25:34,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:34,926 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:34,938 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:34,947 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:34,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:34,947 INFO L82 PathProgramCache]: Analyzing trace with hash 3206, now seen corresponding path program 1 times [2020-07-29 03:25:34,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:34,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735696618] [2020-07-29 03:25:34,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:34,956 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:34,962 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:34,965 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:34,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:34,965 INFO L82 PathProgramCache]: Analyzing trace with hash 405254793, now seen corresponding path program 1 times [2020-07-29 03:25:34,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:34,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66499398] [2020-07-29 03:25:34,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:35,205 INFO L280 TraceCheckUtils]: 0: Hoare triple {662#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {662#true} is VALID [2020-07-29 03:25:35,205 INFO L280 TraceCheckUtils]: 1: Hoare triple {662#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; {662#true} is VALID [2020-07-29 03:25:35,206 INFO L280 TraceCheckUtils]: 2: Hoare triple {662#true} assume !(main_~length1~0 < 1); {664#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:25:35,207 INFO L280 TraceCheckUtils]: 3: Hoare triple {664#(<= 1 ULTIMATE.start_main_~length1~0)} assume !(main_~length2~0 < 2); {664#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:25:35,208 INFO L280 TraceCheckUtils]: 4: Hoare triple {664#(<= 1 ULTIMATE.start_main_~length1~0)} assume !(main_~length3~0 < 1); {664#(<= 1 ULTIMATE.start_main_~length1~0)} is VALID [2020-07-29 03:25:35,210 INFO L280 TraceCheckUtils]: 5: Hoare triple {664#(<= 1 ULTIMATE.start_main_~length1~0)} assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; {665#(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)))) (or (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (and (= 0 ULTIMATE.start_main_~i~0) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))) (= 0 ULTIMATE.start_main_~nondetString1~0.offset))} is VALID [2020-07-29 03:25:35,211 INFO L280 TraceCheckUtils]: 6: Hoare triple {665#(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)))) (or (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)) (and (= 0 ULTIMATE.start_main_~i~0) (< 0 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))) (= 0 ULTIMATE.start_main_~nondetString1~0.offset))} assume !(main_~i~0 < main_~length1~0 - 1); {666#(and (= ULTIMATE.start_main_~length1~0 1) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:25:35,212 INFO L280 TraceCheckUtils]: 7: Hoare triple {666#(and (= ULTIMATE.start_main_~length1~0 1) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} main_~i~1 := 0; {666#(and (= ULTIMATE.start_main_~length1~0 1) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:25:35,213 INFO L280 TraceCheckUtils]: 8: Hoare triple {666#(and (= ULTIMATE.start_main_~length1~0 1) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; {666#(and (= ULTIMATE.start_main_~length1~0 1) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:25:35,214 INFO L280 TraceCheckUtils]: 9: Hoare triple {666#(and (= ULTIMATE.start_main_~length1~0 1) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; {666#(and (= ULTIMATE.start_main_~length1~0 1) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:25:35,215 INFO L280 TraceCheckUtils]: 10: Hoare triple {666#(and (= ULTIMATE.start_main_~length1~0 1) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} assume !(main_~i~1 < main_~length2~0 - 1); {666#(and (= ULTIMATE.start_main_~length1~0 1) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ ULTIMATE.start_main_~nondetString1~0.offset ULTIMATE.start_main_~length1~0)))} is VALID [2020-07-29 03:25:35,217 INFO L280 TraceCheckUtils]: 11: Hoare triple {666#(and (= ULTIMATE.start_main_~length1~0 1) (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base)) (= 1 (+ 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_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; {667#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrcat_~s2.base) ULTIMATE.start_cstrcat_~s2.offset))} is VALID [2020-07-29 03:25:35,217 INFO L280 TraceCheckUtils]: 12: Hoare triple {667#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrcat_~s2.base) ULTIMATE.start_cstrcat_~s2.offset))} call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); {667#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrcat_~s2.base) ULTIMATE.start_cstrcat_~s2.offset))} is VALID [2020-07-29 03:25:35,218 INFO L280 TraceCheckUtils]: 13: Hoare triple {667#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrcat_~s2.base) ULTIMATE.start_cstrcat_~s2.offset))} assume !(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2; {667#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrcat_~s2.base) ULTIMATE.start_cstrcat_~s2.offset))} is VALID [2020-07-29 03:25:35,219 INFO L280 TraceCheckUtils]: 14: Hoare triple {667#(= 0 (select (select |#memory_int| ULTIMATE.start_cstrcat_~s2.base) ULTIMATE.start_cstrcat_~s2.offset))} cstrcat_#t~post4.base, cstrcat_#t~post4.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post4.base, 1 + cstrcat_#t~post4.offset;cstrcat_#t~post5.base, cstrcat_#t~post5.offset := cstrcat_~s2.base, cstrcat_~s2.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#t~post5.base, 1 + cstrcat_#t~post5.offset;call cstrcat_#t~mem6 := read~int(cstrcat_#t~post5.base, cstrcat_#t~post5.offset, 1);call write~int(cstrcat_#t~mem6, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, 1); {668#(= 0 |ULTIMATE.start_cstrcat_#t~mem6|)} is VALID [2020-07-29 03:25:35,220 INFO L280 TraceCheckUtils]: 15: Hoare triple {668#(= 0 |ULTIMATE.start_cstrcat_#t~mem6|)} assume !!(0 != cstrcat_#t~mem6);havoc cstrcat_#t~post4.base, cstrcat_#t~post4.offset;havoc cstrcat_#t~post5.base, cstrcat_#t~post5.offset;havoc cstrcat_#t~mem6; {663#false} is VALID [2020-07-29 03:25:35,221 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:25:35,221 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66499398] [2020-07-29 03:25:35,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:35,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 03:25:35,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621715416] [2020-07-29 03:25:35,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:35,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 03:25:35,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-29 03:25:35,313 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 7 states. [2020-07-29 03:25:35,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:35,533 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2020-07-29 03:25:35,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 03:25:35,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 03:25:35,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:35,572 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2020-07-29 03:25:35,574 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:35,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 33 states and 42 transitions. [2020-07-29 03:25:35,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-07-29 03:25:35,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-07-29 03:25:35,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2020-07-29 03:25:35,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:35,576 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2020-07-29 03:25:35,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2020-07-29 03:25:35,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-07-29 03:25:35,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:35,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 42 transitions. Second operand 32 states. [2020-07-29 03:25:35,583 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 42 transitions. Second operand 32 states. [2020-07-29 03:25:35,584 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 32 states. [2020-07-29 03:25:35,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:35,585 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2020-07-29 03:25:35,585 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2020-07-29 03:25:35,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:35,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:35,586 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states and 42 transitions. [2020-07-29 03:25:35,586 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states and 42 transitions. [2020-07-29 03:25:35,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:35,588 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2020-07-29 03:25:35,588 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2020-07-29 03:25:35,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:35,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:35,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:35,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:35,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-29 03:25:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2020-07-29 03:25:35,590 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2020-07-29 03:25:35,590 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2020-07-29 03:25:35,590 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:25:35,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2020-07-29 03:25:35,591 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:35,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:35,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:35,591 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:35,592 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:35,592 INFO L794 eck$LassoCheckResult]: Stem: 731#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 725#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 726#L527 assume !(main_~length1~0 < 1); 719#L527-2 assume !(main_~length2~0 < 2); 720#L530-1 assume !(main_~length3~0 < 1); 727#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 713#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 715#L540-4 main_~i~1 := 0; 718#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 739#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 738#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 737#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 736#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 735#L545-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_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 712#L517-3 [2020-07-29 03:25:35,592 INFO L796 eck$LassoCheckResult]: Loop: 712#L517-3 call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); 711#L517-1 assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; 712#L517-3 [2020-07-29 03:25:35,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:35,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1898962205, now seen corresponding path program 2 times [2020-07-29 03:25:35,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:35,593 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706677503] [2020-07-29 03:25:35,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,609 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,621 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,625 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:35,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:35,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 3 times [2020-07-29 03:25:35,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:35,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944539811] [2020-07-29 03:25:35,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,630 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,632 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,633 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:35,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:35,634 INFO L82 PathProgramCache]: Analyzing trace with hash 458423656, now seen corresponding path program 2 times [2020-07-29 03:25:35,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:35,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776029968] [2020-07-29 03:25:35,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,651 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:35,666 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:35,671 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:36,410 WARN L193 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 122 [2020-07-29 03:25:36,690 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-07-29 03:25:36,693 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:36,694 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:36,694 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:36,694 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:36,694 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:36,694 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:36,694 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:36,694 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:36,694 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration6_Lasso [2020-07-29 03:25:36,694 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:36,694 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:36,729 INFO L141 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:25:36,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:37,144 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2020-07-29 03:25:37,222 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:25:37,226 INFO L141 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:25:37,230 INFO L141 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:25:37,233 INFO L141 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:25:37,236 INFO L141 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:25:37,246 INFO L141 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:25:37,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:37,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:37,257 INFO L141 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:25:37,261 INFO L141 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:25:37,266 INFO L141 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:25:37,269 INFO L141 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:25:37,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:37,277 INFO L141 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:25:37,280 INFO L141 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:25:37,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:37,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:37,294 INFO L141 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:25:37,298 INFO L141 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:25:37,301 INFO L141 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:25:37,306 INFO L141 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:25:37,310 INFO L141 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:25:37,313 INFO L141 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:25:37,317 INFO L141 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:25:37,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:25:37,323 INFO L141 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:25:37,764 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-07-29 03:25:38,419 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:38,420 INFO L489 LassoAnalysis]: Using template 'affine'. 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:25:38,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:38,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:38,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,427 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:38,427 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:38,428 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:25:38,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:38,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:38,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:38,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:38,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,486 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:38,487 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:38,496 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,519 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:38,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:38,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:38,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:38,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:38,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:38,530 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:38,554 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:38,656 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2020-07-29 03:25:38,656 INFO L444 ModelExtractionUtils]: 10 out of 46 variables were initially zero. Simplification set additionally 31 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:38,661 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:38,665 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 03:25:38,665 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:38,665 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcat_~s~0.offset) = -2*ULTIMATE.start_cstrcat_~s~0.offset + 5 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_3 + 3 >= 0] [2020-07-29 03:25:38,759 INFO L297 tatePredicateManager]: 10 out of 12 supporting invariants were superfluous and have been removed [2020-07-29 03:25:38,770 INFO L393 LassoCheck]: Loop: "call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1);" "assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset;" [2020-07-29 03:25:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:38,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:38,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 15 conjunts are in the unsatisfiable core [2020-07-29 03:25:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:38,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:38,860 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:25:38,861 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-29 03:25:38,861 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:25:38,883 INFO L624 ElimStorePlain]: treesize reduction 10, result has 65.5 percent of original size [2020-07-29 03:25:38,884 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:25:38,885 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2020-07-29 03:25:38,889 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:25:38,889 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_86|, |ULTIMATE.start_main_#t~malloc10.base|, ULTIMATE.start_main_~length1~0]. (and (= (store (store |v_#length_86| |ULTIMATE.start_main_#t~malloc10.base| ULTIMATE.start_main_~length1~0) |ULTIMATE.start_main_#t~malloc11.base| ULTIMATE.start_main_~length2~0) |#length|) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded) [2020-07-29 03:25:38,889 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded) [2020-07-29 03:25:39,077 INFO L280 TraceCheckUtils]: 0: Hoare triple {818#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {818#unseeded} is VALID [2020-07-29 03:25:39,078 INFO L280 TraceCheckUtils]: 1: Hoare triple {818#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; {818#unseeded} is VALID [2020-07-29 03:25:39,079 INFO L280 TraceCheckUtils]: 2: Hoare triple {818#unseeded} assume !(main_~length1~0 < 1); {818#unseeded} is VALID [2020-07-29 03:25:39,079 INFO L280 TraceCheckUtils]: 3: Hoare triple {818#unseeded} assume !(main_~length2~0 < 2); {818#unseeded} is VALID [2020-07-29 03:25:39,080 INFO L280 TraceCheckUtils]: 4: Hoare triple {818#unseeded} assume !(main_~length3~0 < 1); {818#unseeded} is VALID [2020-07-29 03:25:39,082 INFO L280 TraceCheckUtils]: 5: Hoare triple {818#unseeded} assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; {917#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} is VALID [2020-07-29 03:25:39,083 INFO L280 TraceCheckUtils]: 6: Hoare triple {917#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} assume !(main_~i~0 < main_~length1~0 - 1); {917#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} is VALID [2020-07-29 03:25:39,084 INFO L280 TraceCheckUtils]: 7: Hoare triple {917#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} main_~i~1 := 0; {924#(and (<= ULTIMATE.start_main_~i~1 0) (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} is VALID [2020-07-29 03:25:39,086 INFO L280 TraceCheckUtils]: 8: Hoare triple {924#(and (<= ULTIMATE.start_main_~i~1 0) (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; {924#(and (<= ULTIMATE.start_main_~i~1 0) (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} is VALID [2020-07-29 03:25:39,087 INFO L280 TraceCheckUtils]: 9: Hoare triple {924#(and (<= ULTIMATE.start_main_~i~1 0) (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; {931#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (<= ULTIMATE.start_main_~i~1 1) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} is VALID [2020-07-29 03:25:39,088 INFO L280 TraceCheckUtils]: 10: Hoare triple {931#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (<= ULTIMATE.start_main_~i~1 1) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; {931#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (<= ULTIMATE.start_main_~i~1 1) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} is VALID [2020-07-29 03:25:39,089 INFO L280 TraceCheckUtils]: 11: Hoare triple {931#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (<= ULTIMATE.start_main_~i~1 1) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; {938#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) (<= ULTIMATE.start_main_~i~1 2) unseeded)} is VALID [2020-07-29 03:25:39,090 INFO L280 TraceCheckUtils]: 12: Hoare triple {938#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) (<= ULTIMATE.start_main_~i~1 2) unseeded)} assume !(main_~i~1 < main_~length2~0 - 1); {942#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) 3) unseeded)} is VALID [2020-07-29 03:25:39,092 INFO L280 TraceCheckUtils]: 13: Hoare triple {942#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) 3) 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_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; {893#(and unseeded (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) 3) 0) (= |ULTIMATE.start_main_#t~malloc11.base| ULTIMATE.start_cstrcat_~s~0.base))} is VALID [2020-07-29 03:25:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:39,098 WARN L261 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 03:25:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:39,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:39,144 INFO L280 TraceCheckUtils]: 0: Hoare triple {894#(and (>= oldRank0 (+ (* (- 2) ULTIMATE.start_cstrcat_~s~0.offset) 5)) (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) 3) 0) (= |ULTIMATE.start_main_#t~malloc11.base| ULTIMATE.start_cstrcat_~s~0.base))} call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); {946#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) 3) (<= (+ ULTIMATE.start_cstrcat_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcat_~s~0.base)) (<= 5 (+ (* 2 ULTIMATE.start_cstrcat_~s~0.offset) oldRank0)) (= |ULTIMATE.start_main_#t~malloc11.base| ULTIMATE.start_cstrcat_~s~0.base))} is VALID [2020-07-29 03:25:39,147 INFO L280 TraceCheckUtils]: 1: Hoare triple {946#(and (<= (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) 3) (<= (+ ULTIMATE.start_cstrcat_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcat_~s~0.base)) (<= 5 (+ (* 2 ULTIMATE.start_cstrcat_~s~0.offset) oldRank0)) (= |ULTIMATE.start_main_#t~malloc11.base| ULTIMATE.start_cstrcat_~s~0.base))} assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; {896#(and (or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_cstrcat_~s~0.offset) 5)) (>= oldRank0 0)) unseeded) (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) 3) 0) (= |ULTIMATE.start_main_#t~malloc11.base| ULTIMATE.start_cstrcat_~s~0.base))} is VALID [2020-07-29 03:25:39,147 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:25:39,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 03:25:39,175 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:39,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:39,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,176 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2020-07-29 03:25:39,177 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 41 transitions. cyclomatic complexity: 15 Second operand 8 states. [2020-07-29 03:25:39,528 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 41 transitions. cyclomatic complexity: 15. Second operand 8 states. Result 58 states and 74 transitions. Complement of second has 14 states. [2020-07-29 03:25:39,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2020-07-29 03:25:39,529 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:39,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. cyclomatic complexity: 15 [2020-07-29 03:25:39,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:39,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:39,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 03:25:39,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:39,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:39,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:39,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 74 transitions. [2020-07-29 03:25:39,532 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:39,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:39,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:39,533 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 41 transitions. cyclomatic complexity: 15 [2020-07-29 03:25:39,534 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:25:39,534 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 03:25:39,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:39,536 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:39,536 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 58 states and 74 transitions. cyclomatic complexity: 25 [2020-07-29 03:25:39,537 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:25:39,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:39,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:39,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 74 transitions. cyclomatic complexity: 25 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:39,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:39,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:39,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 74 transitions. cyclomatic complexity: 25 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:39,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:39,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:39,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 74 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:39,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 58 letters. Loop has 58 letters. [2020-07-29 03:25:39,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 58 letters. Loop has 58 letters. [2020-07-29 03:25:39,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 74 transitions. cyclomatic complexity: 25 Stem has 58 letters. Loop has 58 letters. [2020-07-29 03:25:39,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 32 letters. Loop has 32 letters. [2020-07-29 03:25:39,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 32 letters. Loop has 32 letters. [2020-07-29 03:25:39,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 74 transitions. cyclomatic complexity: 25 Stem has 32 letters. Loop has 32 letters. [2020-07-29 03:25:39,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 11 letters. [2020-07-29 03:25:39,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 03:25:39,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 74 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 11 letters. [2020-07-29 03:25:39,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:39,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:39,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 74 transitions. cyclomatic complexity: 25 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:39,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:39,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:39,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 74 transitions. cyclomatic complexity: 25 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:39,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:39,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:39,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 74 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:39,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:39,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:39,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 74 transitions. cyclomatic complexity: 25 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:39,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:39,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:39,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 74 transitions. cyclomatic complexity: 25 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:39,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:39,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:39,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 74 transitions. cyclomatic complexity: 25 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:39,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:39,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:39,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 74 transitions. cyclomatic complexity: 25 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:39,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:39,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:39,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 74 transitions. cyclomatic complexity: 25 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:39,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:39,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:39,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 74 transitions. cyclomatic complexity: 25 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:39,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:39,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:39,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 74 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:39,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:39,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:39,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 74 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:39,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:39,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:39,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 74 transitions. cyclomatic complexity: 25 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:39,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 15 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:39,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:39,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 74 transitions. cyclomatic complexity: 25 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:39,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,552 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:39,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 03:25:39,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2020-07-29 03:25:39,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 33 transitions. Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:39,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 33 transitions. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:39,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 33 transitions. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:25:39,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:39,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 74 transitions. cyclomatic complexity: 25 [2020-07-29 03:25:39,556 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:39,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 39 states and 48 transitions. [2020-07-29 03:25:39,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-07-29 03:25:39,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-07-29 03:25:39,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2020-07-29 03:25:39,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:39,559 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2020-07-29 03:25:39,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2020-07-29 03:25:39,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2020-07-29 03:25:39,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:39,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states and 48 transitions. Second operand 33 states. [2020-07-29 03:25:39,564 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states and 48 transitions. Second operand 33 states. [2020-07-29 03:25:39,564 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 33 states. [2020-07-29 03:25:39,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:39,566 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2020-07-29 03:25:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2020-07-29 03:25:39,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:39,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:39,569 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 39 states and 48 transitions. [2020-07-29 03:25:39,569 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 39 states and 48 transitions. [2020-07-29 03:25:39,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:39,573 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2020-07-29 03:25:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2020-07-29 03:25:39,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:39,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:39,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:39,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-29 03:25:39,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2020-07-29 03:25:39,577 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2020-07-29 03:25:39,577 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2020-07-29 03:25:39,577 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 03:25:39,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2020-07-29 03:25:39,578 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:39,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:39,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:39,579 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:39,579 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:39,579 INFO L794 eck$LassoCheckResult]: Stem: 1056#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1052#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 1053#L527 assume !(main_~length1~0 < 1); 1046#L527-2 assume !(main_~length2~0 < 2); 1047#L530-1 assume !(main_~length3~0 < 1); 1054#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 1040#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 1042#L540-4 main_~i~1 := 0; 1045#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1050#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1051#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1055#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1070#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1062#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1060#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 1061#L545-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_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 1039#L517-3 [2020-07-29 03:25:39,579 INFO L796 eck$LassoCheckResult]: Loop: 1039#L517-3 call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); 1038#L517-1 assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; 1039#L517-3 [2020-07-29 03:25:39,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:39,580 INFO L82 PathProgramCache]: Analyzing trace with hash 458478981, now seen corresponding path program 3 times [2020-07-29 03:25:39,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:39,580 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707898655] [2020-07-29 03:25:39,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:39,602 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:39,626 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:39,633 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:39,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:39,634 INFO L82 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 4 times [2020-07-29 03:25:39,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:39,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61754331] [2020-07-29 03:25:39,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:39,637 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:39,640 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:39,642 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:39,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:39,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1783328886, now seen corresponding path program 3 times [2020-07-29 03:25:39,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:39,647 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722729401] [2020-07-29 03:25:39,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:39,678 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:39,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:39,703 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:39,724 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:40,837 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 163 DAG size of output: 131 [2020-07-29 03:25:41,170 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2020-07-29 03:25:41,175 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:41,176 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:41,176 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:41,176 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:41,176 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:41,176 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:41,176 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:41,177 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:41,177 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration7_Lasso [2020-07-29 03:25:41,177 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:41,177 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:41,205 INFO L141 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:25:41,209 INFO L141 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:25:41,212 INFO L141 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:25:41,218 INFO L141 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:25:41,235 INFO L141 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:25:41,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:41,245 INFO L141 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:25:41,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:41,256 INFO L141 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:25:41,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:41,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:41,268 INFO L141 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:25:41,271 INFO L141 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:25:41,275 INFO L141 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:25:41,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:41,284 INFO L141 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:25:41,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:41,660 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 79 [2020-07-29 03:25:41,734 WARN L257 bleTransFormulaUtils]: 3 quantified variables [2020-07-29 03:25:41,738 INFO L141 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:25:41,741 INFO L141 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:25:41,744 INFO L141 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:25:41,747 INFO L141 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:25:41,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:41,758 INFO L141 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:25:41,761 INFO L141 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:25:41,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:41,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:42,267 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2020-07-29 03:25:42,860 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:42,861 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 03:25:42,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:42,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:42,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:42,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:42,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:42,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:42,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:42,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:42,873 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:25:42,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:42,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:42,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:42,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:42,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:42,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:42,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:42,903 INFO L402 nArgumentSynthesizer]: A total of 0 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:25:42,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:42,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:42,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:42,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:42,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:42,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:42,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:42,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:42,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:42,930 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:42,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:42,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:42,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:42,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:42,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:42,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:42,954 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:42,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:42,955 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:42,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:42,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:42,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:42,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:42,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:42,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:42,982 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:42,984 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:25:43,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:43,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:43,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:43,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:43,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:43,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:43,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:43,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:43,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:43,033 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:43,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:43,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:43,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:43,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:43,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:43,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:43,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:43,036 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) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:43,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:43,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:43,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:43,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:43,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:43,061 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:43,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:43,064 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:25:43,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:43,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:43,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:43,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:43,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:43,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:43,091 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:43,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:43,092 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:25:43,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:43,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:43,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:43,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:43,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:43,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:43,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:43,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:43,120 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:25:43,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:43,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:43,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:43,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:43,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:43,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:43,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:43,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:43,147 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:25:43,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:43,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:43,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:43,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:43,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:43,174 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:43,174 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:43,179 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:25:43,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:43,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:43,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:43,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:43,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:43,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:43,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:43,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:43,218 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) [2020-07-29 03:25:43,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:43,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:43,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:43,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:43,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:43,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:43,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:43,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:43,247 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:25:43,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:43,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:43,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:43,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:43,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:43,275 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:43,275 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:43,279 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:25:43,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:43,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:43,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:43,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:43,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:43,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:43,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:43,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:43,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 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:25:43,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:43,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:43,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:43,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:43,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:43,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:43,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:43,339 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) [2020-07-29 03:25:43,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:43,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:43,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:43,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:43,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:43,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:43,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:43,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:43,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:43,400 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:43,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:43,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:43,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:43,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:43,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:43,426 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:43,456 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-07-29 03:25:43,457 INFO L444 ModelExtractionUtils]: 41 out of 52 variables were initially zero. Simplification set additionally 6 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:25:43,462 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:43,464 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 03:25:43,464 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:43,464 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcat_~s~0.offset) = -2*ULTIMATE.start_cstrcat_~s~0.offset + 7 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_4 + 4 >= 0] [2020-07-29 03:25:43,531 INFO L297 tatePredicateManager]: 8 out of 10 supporting invariants were superfluous and have been removed [2020-07-29 03:25:43,537 INFO L393 LassoCheck]: Loop: "call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1);" "assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset;" [2020-07-29 03:25:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:43,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:43,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-29 03:25:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:43,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:43,631 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 03:25:43,632 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2020-07-29 03:25:43,632 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 03:25:43,659 INFO L624 ElimStorePlain]: treesize reduction 10, result has 65.5 percent of original size [2020-07-29 03:25:43,661 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 03:25:43,661 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:10 [2020-07-29 03:25:43,666 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 03:25:43,666 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#length_110|, |ULTIMATE.start_main_#t~malloc10.base|, ULTIMATE.start_main_~length1~0]. (and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) (= |#length| (store (store |v_#length_110| |ULTIMATE.start_main_#t~malloc10.base| ULTIMATE.start_main_~length1~0) |ULTIMATE.start_main_#t~malloc11.base| ULTIMATE.start_main_~length2~0)) unseeded) [2020-07-29 03:25:43,666 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded) [2020-07-29 03:25:43,969 INFO L280 TraceCheckUtils]: 0: Hoare triple {1158#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1158#unseeded} is VALID [2020-07-29 03:25:43,970 INFO L280 TraceCheckUtils]: 1: Hoare triple {1158#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; {1158#unseeded} is VALID [2020-07-29 03:25:43,971 INFO L280 TraceCheckUtils]: 2: Hoare triple {1158#unseeded} assume !(main_~length1~0 < 1); {1158#unseeded} is VALID [2020-07-29 03:25:43,971 INFO L280 TraceCheckUtils]: 3: Hoare triple {1158#unseeded} assume !(main_~length2~0 < 2); {1158#unseeded} is VALID [2020-07-29 03:25:43,971 INFO L280 TraceCheckUtils]: 4: Hoare triple {1158#unseeded} assume !(main_~length3~0 < 1); {1158#unseeded} is VALID [2020-07-29 03:25:43,973 INFO L280 TraceCheckUtils]: 5: Hoare triple {1158#unseeded} assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; {1247#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} is VALID [2020-07-29 03:25:43,973 INFO L280 TraceCheckUtils]: 6: Hoare triple {1247#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} assume !(main_~i~0 < main_~length1~0 - 1); {1247#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} is VALID [2020-07-29 03:25:43,974 INFO L280 TraceCheckUtils]: 7: Hoare triple {1247#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} main_~i~1 := 0; {1254#(and (<= ULTIMATE.start_main_~i~1 0) (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} is VALID [2020-07-29 03:25:43,975 INFO L280 TraceCheckUtils]: 8: Hoare triple {1254#(and (<= ULTIMATE.start_main_~i~1 0) (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; {1254#(and (<= ULTIMATE.start_main_~i~1 0) (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} is VALID [2020-07-29 03:25:43,976 INFO L280 TraceCheckUtils]: 9: Hoare triple {1254#(and (<= ULTIMATE.start_main_~i~1 0) (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; {1261#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (<= ULTIMATE.start_main_~i~1 1) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} is VALID [2020-07-29 03:25:43,977 INFO L280 TraceCheckUtils]: 10: Hoare triple {1261#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (<= ULTIMATE.start_main_~i~1 1) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; {1261#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (<= ULTIMATE.start_main_~i~1 1) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} is VALID [2020-07-29 03:25:43,979 INFO L280 TraceCheckUtils]: 11: Hoare triple {1261#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (<= ULTIMATE.start_main_~i~1 1) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; {1268#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) (<= ULTIMATE.start_main_~i~1 2) unseeded)} is VALID [2020-07-29 03:25:43,980 INFO L280 TraceCheckUtils]: 12: Hoare triple {1268#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) (<= ULTIMATE.start_main_~i~1 2) unseeded)} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; {1268#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) (<= ULTIMATE.start_main_~i~1 2) unseeded)} is VALID [2020-07-29 03:25:43,981 INFO L280 TraceCheckUtils]: 13: Hoare triple {1268#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) (<= ULTIMATE.start_main_~i~1 2) unseeded)} main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; {1275#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (<= ULTIMATE.start_main_~i~1 3) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} is VALID [2020-07-29 03:25:43,982 INFO L280 TraceCheckUtils]: 14: Hoare triple {1275#(and (= ULTIMATE.start_main_~length2~0 (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) (<= ULTIMATE.start_main_~i~1 3) (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) unseeded)} assume !(main_~i~1 < main_~length2~0 - 1); {1279#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) 4) unseeded)} is VALID [2020-07-29 03:25:43,983 INFO L280 TraceCheckUtils]: 15: Hoare triple {1279#(and (= ULTIMATE.start_main_~nondetString2~0.base |ULTIMATE.start_main_#t~malloc11.base|) (<= (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) 4) 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_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; {1223#(and unseeded (= |ULTIMATE.start_main_#t~malloc11.base| ULTIMATE.start_cstrcat_~s~0.base) (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) 4) 0))} is VALID [2020-07-29 03:25:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:43,990 WARN L261 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 03:25:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:43,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:44,026 INFO L280 TraceCheckUtils]: 0: Hoare triple {1224#(and (>= oldRank0 (+ (* (- 2) ULTIMATE.start_cstrcat_~s~0.offset) 7)) (= |ULTIMATE.start_main_#t~malloc11.base| ULTIMATE.start_cstrcat_~s~0.base) (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) 4) 0))} call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); {1283#(and (<= 7 (+ (* 2 ULTIMATE.start_cstrcat_~s~0.offset) oldRank0)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) 4) (<= (+ ULTIMATE.start_cstrcat_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcat_~s~0.base)) (= |ULTIMATE.start_main_#t~malloc11.base| ULTIMATE.start_cstrcat_~s~0.base))} is VALID [2020-07-29 03:25:44,028 INFO L280 TraceCheckUtils]: 1: Hoare triple {1283#(and (<= 7 (+ (* 2 ULTIMATE.start_cstrcat_~s~0.offset) oldRank0)) (<= (select |#length| |ULTIMATE.start_main_#t~malloc11.base|) 4) (<= (+ ULTIMATE.start_cstrcat_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcat_~s~0.base)) (= |ULTIMATE.start_main_#t~malloc11.base| ULTIMATE.start_cstrcat_~s~0.base))} assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; {1226#(and (or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_cstrcat_~s~0.offset) 7)) (>= oldRank0 0)) unseeded) (= |ULTIMATE.start_main_#t~malloc11.base| ULTIMATE.start_cstrcat_~s~0.base) (>= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_#t~malloc11.base|)) 4) 0))} is VALID [2020-07-29 03:25:44,028 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:25:44,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 03:25:44,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:44,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:44,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,065 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2020-07-29 03:25:44,065 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 14 Second operand 9 states. [2020-07-29 03:25:44,401 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 14. Second operand 9 states. Result 58 states and 72 transitions. Complement of second has 14 states. [2020-07-29 03:25:44,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 2 non-accepting loop states 2 accepting loop states [2020-07-29 03:25:44,401 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:44,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. cyclomatic complexity: 14 [2020-07-29 03:25:44,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:44,402 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:44,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 03:25:44,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:44,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:44,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:44,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 72 transitions. [2020-07-29 03:25:44,404 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:44,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:44,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:44,405 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states and 41 transitions. cyclomatic complexity: 14 [2020-07-29 03:25:44,406 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:25:44,407 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states. [2020-07-29 03:25:44,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:44,408 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:44,408 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 58 states and 72 transitions. cyclomatic complexity: 23 [2020-07-29 03:25:44,409 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:25:44,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 14 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:44,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:44,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 23 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:44,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:44,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:44,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 23 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:44,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:44,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:44,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 23 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:44,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 14 Stem has 58 letters. Loop has 58 letters. [2020-07-29 03:25:44,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 58 letters. Loop has 58 letters. [2020-07-29 03:25:44,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 23 Stem has 58 letters. Loop has 58 letters. [2020-07-29 03:25:44,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 14 Stem has 33 letters. Loop has 33 letters. [2020-07-29 03:25:44,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 33 letters. Loop has 33 letters. [2020-07-29 03:25:44,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 23 Stem has 33 letters. Loop has 33 letters. [2020-07-29 03:25:44,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 11 letters. [2020-07-29 03:25:44,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 03:25:44,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 23 Stem has 11 letters. Loop has 11 letters. [2020-07-29 03:25:44,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:44,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:44,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 23 Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:44,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 14 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:44,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:44,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 23 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:44,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:44,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:44,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 23 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:44,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:44,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:44,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 23 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:44,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:44,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:44,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 23 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:44,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:44,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:44,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 23 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:44,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:44,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:44,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 23 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:44,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:44,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:44,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 23 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:44,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:44,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:44,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 23 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:44,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 2 letters. [2020-07-29 03:25:44,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 22 letters. Loop has 2 letters. [2020-07-29 03:25:44,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 23 Stem has 22 letters. Loop has 2 letters. [2020-07-29 03:25:44,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 2 letters. [2020-07-29 03:25:44,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 23 letters. Loop has 2 letters. [2020-07-29 03:25:44,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 23 Stem has 23 letters. Loop has 2 letters. [2020-07-29 03:25:44,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 2 letters. [2020-07-29 03:25:44,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 22 letters. Loop has 2 letters. [2020-07-29 03:25:44,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 23 Stem has 22 letters. Loop has 2 letters. [2020-07-29 03:25:44,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 41 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 2 letters. [2020-07-29 03:25:44,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 23 letters. Loop has 2 letters. [2020-07-29 03:25:44,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 72 transitions. cyclomatic complexity: 23 Stem has 23 letters. Loop has 2 letters. [2020-07-29 03:25:44,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,433 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 03:25:44,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2020-07-29 03:25:44,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 33 transitions. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:44,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 33 transitions. Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:44,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 33 transitions. Stem has 16 letters. Loop has 4 letters. [2020-07-29 03:25:44,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:44,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 72 transitions. cyclomatic complexity: 23 [2020-07-29 03:25:44,438 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:44,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 43 states and 52 transitions. [2020-07-29 03:25:44,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-07-29 03:25:44,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-07-29 03:25:44,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 52 transitions. [2020-07-29 03:25:44,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:44,441 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2020-07-29 03:25:44,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 52 transitions. [2020-07-29 03:25:44,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2020-07-29 03:25:44,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:44,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states and 52 transitions. Second operand 37 states. [2020-07-29 03:25:44,445 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states and 52 transitions. Second operand 37 states. [2020-07-29 03:25:44,445 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 37 states. [2020-07-29 03:25:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:44,447 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2020-07-29 03:25:44,447 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2020-07-29 03:25:44,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:44,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:44,448 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 43 states and 52 transitions. [2020-07-29 03:25:44,448 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 43 states and 52 transitions. [2020-07-29 03:25:44,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:44,450 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2020-07-29 03:25:44,450 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2020-07-29 03:25:44,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:44,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:44,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:44,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-29 03:25:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2020-07-29 03:25:44,453 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 45 transitions. [2020-07-29 03:25:44,453 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 45 transitions. [2020-07-29 03:25:44,453 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 03:25:44,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 45 transitions. [2020-07-29 03:25:44,454 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2020-07-29 03:25:44,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:44,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:44,455 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:44,455 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:44,455 INFO L794 eck$LassoCheckResult]: Stem: 1392#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1388#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; 1389#L527 assume !(main_~length1~0 < 1); 1382#L527-2 assume !(main_~length2~0 < 2); 1383#L530-1 assume !(main_~length3~0 < 1); 1390#L533-1 assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; 1376#L540-3 assume !(main_~i~0 < main_~length1~0 - 1); 1378#L540-4 main_~i~1 := 0; 1381#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1386#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1387#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1391#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1410#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1409#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1408#L545-3 assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; 1398#L545-2 main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; 1396#L545-3 assume !(main_~i~1 < main_~length2~0 - 1); 1397#L545-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_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; 1375#L517-3 [2020-07-29 03:25:44,455 INFO L796 eck$LassoCheckResult]: Loop: 1375#L517-3 call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); 1374#L517-1 assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; 1375#L517-3 [2020-07-29 03:25:44,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:44,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1783273561, now seen corresponding path program 4 times [2020-07-29 03:25:44,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:44,456 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141261067] [2020-07-29 03:25:44,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:44,470 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:44,481 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:44,486 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:44,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:44,487 INFO L82 PathProgramCache]: Analyzing trace with hash 2822, now seen corresponding path program 5 times [2020-07-29 03:25:44,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:44,487 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243950517] [2020-07-29 03:25:44,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:44,491 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:44,493 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:44,494 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:44,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:44,495 INFO L82 PathProgramCache]: Analyzing trace with hash -33939156, now seen corresponding path program 4 times [2020-07-29 03:25:44,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:44,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009373986] [2020-07-29 03:25:44,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:44,513 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:44,528 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:44,533 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:46,366 WARN L193 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 177 DAG size of output: 142 [2020-07-29 03:25:46,756 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-07-29 03:25:46,760 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:46,760 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:46,761 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:46,761 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:46,761 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:46,761 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:46,761 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:46,761 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:46,761 INFO L133 ssoRankerPreferences]: Filename of dumped script: cstrcat-alloca-2.i_Iteration8_Lasso [2020-07-29 03:25:46,761 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:46,761 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:46,801 INFO L141 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:25:46,805 INFO L141 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:25:46,809 INFO L141 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:25:46,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:46,817 INFO L141 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:25:46,821 INFO L141 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:25:46,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:25:46,828 INFO L141 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:25:46,833 INFO L141 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:25:46,835 INFO L141 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:25:46,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:46,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:47,258 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2020-07-29 03:25:47,334 WARN L257 bleTransFormulaUtils]: 4 quantified variables [2020-07-29 03:25:47,339 INFO L141 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:25:47,342 INFO L141 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:25:47,346 INFO L141 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:25:47,350 INFO L141 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:25:47,354 INFO L141 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:25:47,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:25:47,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:25:47,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:47,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:25:47,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:47,380 INFO L141 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:25:47,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:25:47,385 INFO L141 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:25:47,388 INFO L141 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:25:47,915 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2020-07-29 03:25:48,476 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:48,476 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:25:48,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:48,483 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:48,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:48,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:48,487 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:25:48,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:48,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:48,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:48,514 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:25:48,537 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:48,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,539 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:48,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:48,544 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) [2020-07-29 03:25:48,573 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:48,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:48,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:48,577 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) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:48,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:48,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:48,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:48,603 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:25:48,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:48,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:48,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:48,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:48,632 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) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,675 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:48,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:48,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,677 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:48,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:48,678 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:25:48,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:48,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:48,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,700 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:48,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:48,702 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:25:48,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:48,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:48,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:48,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:48,728 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:48,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:48,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:48,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:48,753 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:25:48,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:25:48,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:48,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:48,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:48,779 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:25:48,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:48,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:48,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,803 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 03:25:48,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,804 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 03:25:48,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:48,805 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:25:48,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:48,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:48,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:48,833 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:25:48,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:25:48,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,860 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:48,860 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:48,862 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:25:48,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:48,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:48,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:48,905 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:25:48,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:25:48,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:48,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:48,956 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:48,987 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-07-29 03:25:48,987 INFO L444 ModelExtractionUtils]: 13 out of 58 variables were initially zero. Simplification set additionally 42 variables to zero. 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:25:48,989 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:48,991 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:48,992 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:48,992 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrcat_~s~0.base)_3, ULTIMATE.start_cstrcat_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrcat_~s~0.base)_3 - 1*ULTIMATE.start_cstrcat_~s~0.offset Supporting invariants [] [2020-07-29 03:25:49,060 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-07-29 03:25:49,063 INFO L393 LassoCheck]: Loop: "call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1);" "assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset;" [2020-07-29 03:25:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:49,067 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:25:49,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:49,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:49,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:49,124 INFO L280 TraceCheckUtils]: 0: Hoare triple {1506#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1506#unseeded} is VALID [2020-07-29 03:25:49,126 INFO L280 TraceCheckUtils]: 1: Hoare triple {1506#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet13, main_#t~post12, main_~i~0, main_#t~nondet15, main_#t~post14, main_~i~1, main_#t~ret16.base, main_#t~ret16.offset, main_~length1~0, main_~length2~0, main_~length3~0, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length1~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~length2~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~length3~0 := main_#t~nondet9;havoc main_#t~nondet9; {1506#unseeded} is VALID [2020-07-29 03:25:49,129 INFO L280 TraceCheckUtils]: 2: Hoare triple {1506#unseeded} assume !(main_~length1~0 < 1); {1506#unseeded} is VALID [2020-07-29 03:25:49,129 INFO L280 TraceCheckUtils]: 3: Hoare triple {1506#unseeded} assume !(main_~length2~0 < 2); {1506#unseeded} is VALID [2020-07-29 03:25:49,130 INFO L280 TraceCheckUtils]: 4: Hoare triple {1506#unseeded} assume !(main_~length3~0 < 1); {1506#unseeded} is VALID [2020-07-29 03:25:49,130 INFO L280 TraceCheckUtils]: 5: Hoare triple {1506#unseeded} assume !(main_~length2~0 - main_~length3~0 < main_~length1~0 || main_~length3~0 > main_~length2~0);call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;main_~i~0 := 0; {1506#unseeded} is VALID [2020-07-29 03:25:49,131 INFO L280 TraceCheckUtils]: 6: Hoare triple {1506#unseeded} assume !(main_~i~0 < main_~length1~0 - 1); {1506#unseeded} is VALID [2020-07-29 03:25:49,131 INFO L280 TraceCheckUtils]: 7: Hoare triple {1506#unseeded} main_~i~1 := 0; {1506#unseeded} is VALID [2020-07-29 03:25:49,131 INFO L280 TraceCheckUtils]: 8: Hoare triple {1506#unseeded} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; {1506#unseeded} is VALID [2020-07-29 03:25:49,132 INFO L280 TraceCheckUtils]: 9: Hoare triple {1506#unseeded} main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; {1506#unseeded} is VALID [2020-07-29 03:25:49,132 INFO L280 TraceCheckUtils]: 10: Hoare triple {1506#unseeded} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; {1506#unseeded} is VALID [2020-07-29 03:25:49,133 INFO L280 TraceCheckUtils]: 11: Hoare triple {1506#unseeded} main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; {1506#unseeded} is VALID [2020-07-29 03:25:49,133 INFO L280 TraceCheckUtils]: 12: Hoare triple {1506#unseeded} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; {1506#unseeded} is VALID [2020-07-29 03:25:49,134 INFO L280 TraceCheckUtils]: 13: Hoare triple {1506#unseeded} main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; {1506#unseeded} is VALID [2020-07-29 03:25:49,134 INFO L280 TraceCheckUtils]: 14: Hoare triple {1506#unseeded} assume !!(main_~i~1 < main_~length2~0 - 1);call write~int(main_#t~nondet15, main_~nondetString2~0.base, main_~nondetString2~0.offset + main_~i~1, 1);havoc main_#t~nondet15; {1506#unseeded} is VALID [2020-07-29 03:25:49,136 INFO L280 TraceCheckUtils]: 15: Hoare triple {1506#unseeded} main_#t~post14 := main_~i~1;main_~i~1 := 1 + main_#t~post14;havoc main_#t~post14; {1506#unseeded} is VALID [2020-07-29 03:25:49,142 INFO L280 TraceCheckUtils]: 16: Hoare triple {1506#unseeded} assume !(main_~i~1 < main_~length2~0 - 1); {1506#unseeded} is VALID [2020-07-29 03:25:49,143 INFO L280 TraceCheckUtils]: 17: Hoare triple {1506#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_~length3~0 - 1), 1);cstrcat_#in~s1.base, cstrcat_#in~s1.offset, cstrcat_#in~s2.base, cstrcat_#in~s2.offset := main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~nondetString1~0.base, main_~nondetString1~0.offset;havoc cstrcat_#res.base, cstrcat_#res.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset, cstrcat_#t~mem2, cstrcat_#t~post4.base, cstrcat_#t~post4.offset, cstrcat_#t~post5.base, cstrcat_#t~post5.offset, cstrcat_#t~mem6, cstrcat_~s1.base, cstrcat_~s1.offset, cstrcat_~s2.base, cstrcat_~s2.offset, cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s1.base, cstrcat_~s1.offset := cstrcat_#in~s1.base, cstrcat_#in~s1.offset;cstrcat_~s2.base, cstrcat_~s2.offset := cstrcat_#in~s2.base, cstrcat_#in~s2.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_~s1.base, cstrcat_~s1.offset; {1506#unseeded} is VALID [2020-07-29 03:25:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:49,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:25:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:49,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:49,170 INFO L280 TraceCheckUtils]: 0: Hoare triple {1509#(>= oldRank0 (+ (select |#length| ULTIMATE.start_cstrcat_~s~0.base) (* (- 1) ULTIMATE.start_cstrcat_~s~0.offset)))} call cstrcat_#t~mem2 := read~int(cstrcat_~s~0.base, cstrcat_~s~0.offset, 1); {1630#(and (<= (select |#length| ULTIMATE.start_cstrcat_~s~0.base) (+ ULTIMATE.start_cstrcat_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcat_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcat_~s~0.base)))} is VALID [2020-07-29 03:25:49,172 INFO L280 TraceCheckUtils]: 1: Hoare triple {1630#(and (<= (select |#length| ULTIMATE.start_cstrcat_~s~0.base) (+ ULTIMATE.start_cstrcat_~s~0.offset oldRank0)) (<= (+ ULTIMATE.start_cstrcat_~s~0.offset 1) (select |#length| ULTIMATE.start_cstrcat_~s~0.base)))} assume !!(0 != cstrcat_#t~mem2);havoc cstrcat_#t~mem2;cstrcat_#t~post3.base, cstrcat_#t~post3.offset := cstrcat_~s~0.base, cstrcat_~s~0.offset;cstrcat_~s~0.base, cstrcat_~s~0.offset := cstrcat_#t~post3.base, 1 + cstrcat_#t~post3.offset;havoc cstrcat_#t~post3.base, cstrcat_#t~post3.offset; {1574#(or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| ULTIMATE.start_cstrcat_~s~0.base) (* (- 1) ULTIMATE.start_cstrcat_~s~0.offset)))) unseeded)} is VALID [2020-07-29 03:25:49,172 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:25:49,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:49,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:49,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:49,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,184 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:25:49,184 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 45 transitions. cyclomatic complexity: 14 Second operand 3 states. [2020-07-29 03:25:49,264 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 45 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 44 states and 54 transitions. Complement of second has 6 states. [2020-07-29 03:25:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:25:49,264 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:49,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 45 transitions. cyclomatic complexity: 14 [2020-07-29 03:25:49,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:49,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:49,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:49,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:49,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:49,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:49,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 54 transitions. [2020-07-29 03:25:49,266 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:25:49,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:25:49,267 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 45 transitions. cyclomatic complexity: 14 [2020-07-29 03:25:49,268 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:25:49,268 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:49,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:49,268 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:49,268 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 44 states and 54 transitions. cyclomatic complexity: 16 [2020-07-29 03:25:49,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 54 transitions. cyclomatic complexity: 16 [2020-07-29 03:25:49,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:25:49,269 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:25:49,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:49,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:49,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:49,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:49,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:49,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:49,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 44 letters. Loop has 44 letters. [2020-07-29 03:25:49,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 44 letters. Loop has 44 letters. [2020-07-29 03:25:49,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 16 Stem has 44 letters. Loop has 44 letters. [2020-07-29 03:25:49,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 37 letters. Loop has 37 letters. [2020-07-29 03:25:49,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 37 letters. [2020-07-29 03:25:49,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 16 Stem has 37 letters. Loop has 37 letters. [2020-07-29 03:25:49,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:49,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:49,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:49,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:49,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:49,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 16 Stem has 19 letters. Loop has 2 letters. [2020-07-29 03:25:49,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:49,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:49,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:49,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 23 letters. Loop has 2 letters. [2020-07-29 03:25:49,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 23 letters. Loop has 2 letters. [2020-07-29 03:25:49,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 16 Stem has 23 letters. Loop has 2 letters. [2020-07-29 03:25:49,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 22 letters. Loop has 2 letters. [2020-07-29 03:25:49,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 2 letters. [2020-07-29 03:25:49,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 16 Stem has 22 letters. Loop has 2 letters. [2020-07-29 03:25:49,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:49,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:49,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:49,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:49,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:49,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 16 Stem has 21 letters. Loop has 2 letters. [2020-07-29 03:25:49,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 45 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:49,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:49,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 44 states and 54 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:49,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,286 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2020-07-29 03:25:49,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 18 letters. Loop has 2 letters. [2020-07-29 03:25:49,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 20 letters. Loop has 2 letters. [2020-07-29 03:25:49,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:25:49,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 54 transitions. cyclomatic complexity: 16 [2020-07-29 03:25:49,291 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:25:49,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2020-07-29 03:25:49,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:25:49,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:25:49,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:25:49,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:49,292 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:25:49,293 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:25:49,293 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:25:49,293 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 03:25:49,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:25:49,293 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:25:49,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:25:49,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:25:49 BoogieIcfgContainer [2020-07-29 03:25:49,300 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:25:49,301 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:25:49,301 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:25:49,301 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:25:49,302 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:24" (3/4) ... [2020-07-29 03:25:49,305 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:25:49,305 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:25:49,309 INFO L168 Benchmark]: Toolchain (without parser) took 25741.52 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 474.0 MB). Free memory was 956.2 MB in the beginning and 1.3 GB in the end (delta: -368.5 MB). Peak memory consumption was 105.4 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:49,310 INFO L168 Benchmark]: CDTParser took 0.28 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:25:49,310 INFO L168 Benchmark]: CACSL2BoogieTranslator took 659.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:49,311 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:49,311 INFO L168 Benchmark]: Boogie Preprocessor took 51.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:25:49,311 INFO L168 Benchmark]: RCFGBuilder took 590.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:49,312 INFO L168 Benchmark]: BuchiAutomizer took 24368.33 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 327.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -239.0 MB). Peak memory consumption was 88.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:49,312 INFO L168 Benchmark]: Witness Printer took 4.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:25:49,315 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 659.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.54 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 590.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 24368.33 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 327.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -239.0 MB). Peak memory consumption was 88.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function length1 + -1 * i and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[nondetString2] + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * s + 5 and consists of 11 locations. One deterministic module has affine ranking function -2 * s + 7 and consists of 11 locations. One deterministic module has affine ranking function unknown-#length-unknown[s] + -1 * s and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.3s and 9 iterations. TraceHistogramMax:4. Analysis of lassos took 19.9s. Construction of modules took 0.6s. Büchi inclusion checks took 3.4s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 18 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 37 states and ocurred in iteration 7. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 132 SDtfs, 247 SDslu, 229 SDs, 0 SdLazy, 263 SolverSat, 72 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital232 mio100 ax108 hnf98 lsp87 ukn67 mio100 lsp57 div100 bol100 ite100 ukn100 eq169 hnf91 smp93 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 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...