./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/invert_string-1.c --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/loops/invert_string-1.c -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 4a1588fc60848c81fe3e90deb977882889461386 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 02:05:06,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 02:05:06,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 02:05:06,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 02:05:06,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 02:05:06,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 02:05:06,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 02:05:06,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 02:05:06,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 02:05:06,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 02:05:06,358 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 02:05:06,359 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 02:05:06,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 02:05:06,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 02:05:06,362 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 02:05:06,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 02:05:06,364 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 02:05:06,366 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 02:05:06,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 02:05:06,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 02:05:06,371 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 02:05:06,372 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 02:05:06,374 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 02:05:06,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 02:05:06,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 02:05:06,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 02:05:06,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 02:05:06,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 02:05:06,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 02:05:06,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 02:05:06,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 02:05:06,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 02:05:06,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 02:05:06,384 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 02:05:06,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 02:05:06,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 02:05:06,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 02:05:06,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 02:05:06,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 02:05:06,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 02:05:06,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 02:05:06,389 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 02:05:06,415 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 02:05:06,419 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 02:05:06,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 02:05:06,421 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 02:05:06,421 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 02:05:06,422 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 02:05:06,424 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 02:05:06,425 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 02:05:06,425 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 02:05:06,425 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 02:05:06,425 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 02:05:06,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 02:05:06,426 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 02:05:06,426 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 02:05:06,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 02:05:06,427 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 02:05:06,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 02:05:06,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 02:05:06,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 02:05:06,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 02:05:06,430 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 02:05:06,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 02:05:06,431 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 02:05:06,431 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 02:05:06,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 02:05:06,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 02:05:06,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 02:05:06,434 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 02:05:06,435 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 02:05:06,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 02:05:06,435 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 02:05:06,435 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 02:05:06,437 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 02:05:06,439 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 -> 4a1588fc60848c81fe3e90deb977882889461386 [2020-07-29 02:05:06,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 02:05:06,759 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 02:05:06,762 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 02:05:06,764 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 02:05:06,765 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 02:05:06,766 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/invert_string-1.c [2020-07-29 02:05:06,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f2dae72e/ff85422f9dd44bb89d8e0b5c3ceec47b/FLAG66619da74 [2020-07-29 02:05:07,314 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 02:05:07,315 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/invert_string-1.c [2020-07-29 02:05:07,321 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f2dae72e/ff85422f9dd44bb89d8e0b5c3ceec47b/FLAG66619da74 [2020-07-29 02:05:07,700 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f2dae72e/ff85422f9dd44bb89d8e0b5c3ceec47b [2020-07-29 02:05:07,704 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 02:05:07,707 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 02:05:07,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 02:05:07,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 02:05:07,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 02:05:07,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:05:07" (1/1) ... [2020-07-29 02:05:07,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f6545e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:07, skipping insertion in model container [2020-07-29 02:05:07,717 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:05:07" (1/1) ... [2020-07-29 02:05:07,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 02:05:07,744 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 02:05:07,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:05:07,942 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 02:05:07,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:05:08,005 INFO L208 MainTranslator]: Completed translation [2020-07-29 02:05:08,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:08 WrapperNode [2020-07-29 02:05:08,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 02:05:08,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 02:05:08,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 02:05:08,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 02:05:08,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:08" (1/1) ... [2020-07-29 02:05:08,084 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:08" (1/1) ... [2020-07-29 02:05:08,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 02:05:08,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 02:05:08,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 02:05:08,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 02:05:08,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:08" (1/1) ... [2020-07-29 02:05:08,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:08" (1/1) ... [2020-07-29 02:05:08,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:08" (1/1) ... [2020-07-29 02:05:08,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:08" (1/1) ... [2020-07-29 02:05:08,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:08" (1/1) ... [2020-07-29 02:05:08,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:08" (1/1) ... [2020-07-29 02:05:08,154 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:08" (1/1) ... [2020-07-29 02:05:08,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 02:05:08,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 02:05:08,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 02:05:08,157 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 02:05:08,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:08" (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 02:05:08,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 02:05:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 02:05:08,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 02:05:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 02:05:08,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 02:05:08,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 02:05:08,615 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 02:05:08,616 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-29 02:05:08,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:05:08 BoogieIcfgContainer [2020-07-29 02:05:08,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 02:05:08,620 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 02:05:08,620 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 02:05:08,624 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 02:05:08,628 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:05:08,628 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 02:05:07" (1/3) ... [2020-07-29 02:05:08,631 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b926f75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:05:08, skipping insertion in model container [2020-07-29 02:05:08,632 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:05:08,632 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:05:08" (2/3) ... [2020-07-29 02:05:08,632 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b926f75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:05:08, skipping insertion in model container [2020-07-29 02:05:08,632 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:05:08,632 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:05:08" (3/3) ... [2020-07-29 02:05:08,634 INFO L371 chiAutomizerObserver]: Analyzing ICFG invert_string-1.c [2020-07-29 02:05:08,709 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 02:05:08,710 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 02:05:08,710 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 02:05:08,710 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 02:05:08,711 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 02:05:08,711 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 02:05:08,711 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 02:05:08,712 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 02:05:08,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-07-29 02:05:08,755 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 02:05:08,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:08,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:08,762 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 02:05:08,763 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 02:05:08,763 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 02:05:08,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-07-29 02:05:08,768 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 02:05:08,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:08,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:08,769 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 02:05:08,769 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 02:05:08,777 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 11#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0; 3#L15true assume !!(main_~MAX~0 > 0); 16#L15-2true call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 7#L20-3true [2020-07-29 02:05:08,778 INFO L796 eck$LassoCheckResult]: Loop: 7#L20-3true assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 8#L20-2true main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 7#L20-3true [2020-07-29 02:05:08,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:08,785 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-07-29 02:05:08,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:08,797 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360110484] [2020-07-29 02:05:08,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:08,921 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:08,951 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:08,974 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:08,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:08,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-07-29 02:05:08,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:08,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982633307] [2020-07-29 02:05:08,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:08,986 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:08,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:08,993 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:08,996 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:08,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:08,999 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-07-29 02:05:08,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:08,999 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101320733] [2020-07-29 02:05:09,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:09,041 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:09,099 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:09,111 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:09,412 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2020-07-29 02:05:09,823 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2020-07-29 02:05:09,855 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:05:09,856 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:05:09,856 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:05:09,856 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:05:09,857 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:05:09,857 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:09,858 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:05:09,858 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:05:09,859 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-1.c_Iteration1_Lasso [2020-07-29 02:05:09,859 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:05:09,860 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:05:09,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:09,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:09,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:09,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:09,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 02:05:09,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:09,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:09,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 02:05:09,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:09,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:09,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:09,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:09,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:10,097 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 02:05:10,097 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 02:05:10,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:10,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:10,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:10,761 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:05:10,767 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 02:05:10,780 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 02:05:10,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:10,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:10,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:10,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:10,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:10,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:10,787 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:10,790 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 02:05:10,826 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 02:05:10,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:10,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:10,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:10,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:10,834 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:05:10,834 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 02:05:10,846 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 02:05:10,886 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 02:05:10,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:10,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:10,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:10,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:10,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:10,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:10,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:10,892 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:10,915 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 02:05:10,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:10,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:10,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:10,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:10,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:10,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:10,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:10,921 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 02:05:10,957 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 02:05:10,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:10,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:10,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:10,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:10,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:10,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:10,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:10,962 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:10,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 02:05:10,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:10,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:10,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:10,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:10,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:10,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:10,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:11,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 02:05:11,032 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 02:05:11,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:11,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:11,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:11,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:11,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:11,036 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:11,036 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:11,038 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 02:05:11,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:05:11,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:11,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:11,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:11,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:11,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:05:11,074 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 02:05:11,083 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 02:05:11,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:05:11,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:11,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:11,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:11,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:11,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:11,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:11,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:11,124 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 02:05:11,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:05:11,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:11,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:11,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:11,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:11,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:11,156 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:11,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:11,158 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 02:05:11,200 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 02:05:11,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:11,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:11,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:11,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:11,206 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:05:11,206 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 02:05:11,211 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) [2020-07-29 02:05:11,258 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 02:05:11,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:11,261 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:11,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:11,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:11,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:11,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:11,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:11,265 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 13 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:05:11,310 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 02:05:11,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:11,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:11,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:11,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:11,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:05:11,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:11,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 02:05:11,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:05:11,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:11,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:11,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:11,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:11,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:11,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:11,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:11,408 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:11,441 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 02:05:11,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:11,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:11,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:11,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:11,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:05:11,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 02:05:11,456 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 02:05:11,493 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 02:05:11,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:11,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:11,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:11,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:11,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:11,495 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:11,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:11,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:11,522 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 02:05:11,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:11,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:11,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:11,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:11,529 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:05:11,529 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 02:05:11,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:11,563 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 02:05:11,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:11,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:11,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:11,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:11,567 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:05:11,568 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 02:05:11,573 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 02:05:11,604 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 02:05:11,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:11,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:11,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:11,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:11,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:05:11,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 02:05:11,626 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:05:11,800 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-07-29 02:05:11,800 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:05:11,824 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:11,829 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 02:05:11,830 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:05:11,831 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_1 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [1*ULTIMATE.start_main_~#str1~0.offset >= 0] [2020-07-29 02:05:11,900 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 02:05:11,906 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2;" "main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1;" [2020-07-29 02:05:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:11,937 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 02:05:11,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:12,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 02:05:12,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:12,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:05:12,033 INFO L280 TraceCheckUtils]: 0: Hoare triple {29#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {29#unseeded} is VALID [2020-07-29 02:05:12,034 INFO L280 TraceCheckUtils]: 1: Hoare triple {29#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0; {29#unseeded} is VALID [2020-07-29 02:05:12,035 INFO L280 TraceCheckUtils]: 2: Hoare triple {29#unseeded} assume !!(main_~MAX~0 > 0); {29#unseeded} is VALID [2020-07-29 02:05:12,037 INFO L280 TraceCheckUtils]: 3: Hoare triple {29#unseeded} call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; {63#(and (>= |ULTIMATE.start_main_~#str1~0.offset| 0) unseeded)} is VALID [2020-07-29 02:05:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:12,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 02:05:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:12,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:05:12,083 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_~#str1~0.base|) (* (- 1) ULTIMATE.start_main_~i~0))) (>= |ULTIMATE.start_main_~#str1~0.offset| 0))} assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; {81#(and (<= (select |#length| |ULTIMATE.start_main_~#str1~0.base|) (+ oldRank0 ULTIMATE.start_main_~i~0)) (<= (+ |ULTIMATE.start_main_~#str1~0.offset| ULTIMATE.start_main_~i~0 1) (select |#length| |ULTIMATE.start_main_~#str1~0.base|)) (<= 0 |ULTIMATE.start_main_~#str1~0.offset|))} is VALID [2020-07-29 02:05:12,085 INFO L280 TraceCheckUtils]: 1: Hoare triple {81#(and (<= (select |#length| |ULTIMATE.start_main_~#str1~0.base|) (+ oldRank0 ULTIMATE.start_main_~i~0)) (<= (+ |ULTIMATE.start_main_~#str1~0.offset| ULTIMATE.start_main_~i~0 1) (select |#length| |ULTIMATE.start_main_~#str1~0.base|)) (<= 0 |ULTIMATE.start_main_~#str1~0.offset|))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {66#(and (>= |ULTIMATE.start_main_~#str1~0.offset| 0) (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_~#str1~0.base|) (* (- 1) ULTIMATE.start_main_~i~0))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 02:05:12,086 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 02:05:12,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:05:12,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:05:12,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 02:05:12,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,130 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 02:05:12,132 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 3 states. [2020-07-29 02:05:12,260 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 3 states. Result 38 states and 55 transitions. Complement of second has 8 states. [2020-07-29 02:05:12,262 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 02:05:12,262 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:05:12,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2020-07-29 02:05:12,269 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 02:05:12,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:12,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:12,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 02:05:12,276 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 02:05:12,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:12,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:12,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 55 transitions. [2020-07-29 02:05:12,282 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 02:05:12,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:12,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:12,290 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states. [2020-07-29 02:05:12,294 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2020-07-29 02:05:12,300 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 02:05:12,301 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 02:05:12,310 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 02:05:12,312 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 02:05:12,313 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 55 transitions. cyclomatic complexity: 23 [2020-07-29 02:05:12,315 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 02:05:12,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 02:05:12,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 02:05:12,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 4 letters. Loop has 2 letters. [2020-07-29 02:05:12,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:05:12,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:05:12,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:05:12,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:05:12,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:05:12,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:05:12,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 38 letters. Loop has 38 letters. [2020-07-29 02:05:12,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 38 letters. [2020-07-29 02:05:12,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 38 letters. Loop has 38 letters. [2020-07-29 02:05:12,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 02:05:12,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 02:05:12,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 19 letters. Loop has 19 letters. [2020-07-29 02:05:12,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:05:12,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:05:12,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:05:12,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 02:05:12,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 02:05:12,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 10 letters. Loop has 4 letters. [2020-07-29 02:05:12,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 02:05:12,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 02:05:12,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 9 letters. Loop has 4 letters. [2020-07-29 02:05:12,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 02:05:12,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 02:05:12,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 10 letters. Loop has 5 letters. [2020-07-29 02:05:12,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:05:12,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:05:12,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:05:12,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 02:05:12,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 02:05:12,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 11 letters. Loop has 4 letters. [2020-07-29 02:05:12,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:05:12,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:05:12,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:05:12,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:05:12,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:05:12,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:05:12,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 02:05:12,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 02:05:12,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 4 letters. Loop has 2 letters. [2020-07-29 02:05:12,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 02:05:12,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 02:05:12,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 5 letters. Loop has 2 letters. [2020-07-29 02:05:12,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:05:12,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:05:12,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:05:12,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:05:12,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:05:12,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:05:12,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 02:05:12,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 02:05:12,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 10 letters. Loop has 4 letters. [2020-07-29 02:05:12,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 02:05:12,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 02:05:12,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 11 letters. Loop has 4 letters. [2020-07-29 02:05:12,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:05:12,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:05:12,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:05:12,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 02:05:12,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 02:05:12,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 9 letters. Loop has 4 letters. [2020-07-29 02:05:12,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 02:05:12,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 5 letters. [2020-07-29 02:05:12,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 10 letters. Loop has 5 letters. [2020-07-29 02:05:12,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:05:12,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:05:12,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:05:12,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:05:12,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:05:12,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 23 Stem has 7 letters. Loop has 2 letters. [2020-07-29 02:05:12,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,361 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:05:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 02:05:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-07-29 02:05:12,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 02:05:12,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:05:12,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:05:12,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:12,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 55 transitions. cyclomatic complexity: 23 [2020-07-29 02:05:12,377 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 02:05:12,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 16 states and 21 transitions. [2020-07-29 02:05:12,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 02:05:12,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 02:05:12,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2020-07-29 02:05:12,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:05:12,387 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-07-29 02:05:12,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2020-07-29 02:05:12,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-29 02:05:12,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:05:12,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 21 transitions. Second operand 16 states. [2020-07-29 02:05:12,421 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 21 transitions. Second operand 16 states. [2020-07-29 02:05:12,424 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand 16 states. [2020-07-29 02:05:12,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:05:12,430 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2020-07-29 02:05:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2020-07-29 02:05:12,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:12,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:12,432 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states and 21 transitions. [2020-07-29 02:05:12,432 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states and 21 transitions. [2020-07-29 02:05:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:05:12,434 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2020-07-29 02:05:12,434 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2020-07-29 02:05:12,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:12,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:12,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:05:12,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:05:12,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 02:05:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2020-07-29 02:05:12,440 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-07-29 02:05:12,440 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-07-29 02:05:12,440 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 02:05:12,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2020-07-29 02:05:12,443 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 02:05:12,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:12,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:12,446 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 02:05:12,446 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 02:05:12,446 INFO L794 eck$LassoCheckResult]: Stem: 148#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 147#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0; 135#L15 assume !!(main_~MAX~0 > 0); 136#L15-2 call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 142#L20-3 assume !(main_~i~0 < main_~MAX~0); 140#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 141#L27-3 [2020-07-29 02:05:12,446 INFO L796 eck$LassoCheckResult]: Loop: 141#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 150#L27-2 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 141#L27-3 [2020-07-29 02:05:12,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:12,447 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-07-29 02:05:12,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:12,448 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043458180] [2020-07-29 02:05:12,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:12,557 INFO L280 TraceCheckUtils]: 0: Hoare triple {186#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {186#true} is VALID [2020-07-29 02:05:12,558 INFO L280 TraceCheckUtils]: 1: Hoare triple {186#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0; {186#true} is VALID [2020-07-29 02:05:12,559 INFO L280 TraceCheckUtils]: 2: Hoare triple {186#true} assume !!(main_~MAX~0 > 0); {188#(<= 1 ULTIMATE.start_main_~MAX~0)} is VALID [2020-07-29 02:05:12,560 INFO L280 TraceCheckUtils]: 3: Hoare triple {188#(<= 1 ULTIMATE.start_main_~MAX~0)} call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; {189#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~MAX~0))} is VALID [2020-07-29 02:05:12,561 INFO L280 TraceCheckUtils]: 4: Hoare triple {189#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~MAX~0))} assume !(main_~i~0 < main_~MAX~0); {187#false} is VALID [2020-07-29 02:05:12,562 INFO L280 TraceCheckUtils]: 5: Hoare triple {187#false} call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; {187#false} is VALID [2020-07-29 02:05:12,563 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 02:05:12,563 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043458180] [2020-07-29 02:05:12,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 02:05:12,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 02:05:12,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264380478] [2020-07-29 02:05:12,568 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 02:05:12,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:12,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 1 times [2020-07-29 02:05:12,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:12,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540514357] [2020-07-29 02:05:12,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:12,576 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:12,587 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:12,590 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:12,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:05:12,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 02:05:12,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 02:05:12,687 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 4 states. [2020-07-29 02:05:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:05:12,774 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-07-29 02:05:12,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 02:05:12,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 02:05:12,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:05:12,784 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2020-07-29 02:05:12,785 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 02:05:12,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 22 transitions. [2020-07-29 02:05:12,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 02:05:12,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 02:05:12,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2020-07-29 02:05:12,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:05:12,787 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-07-29 02:05:12,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2020-07-29 02:05:12,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2020-07-29 02:05:12,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:05:12,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 22 transitions. Second operand 15 states. [2020-07-29 02:05:12,788 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 22 transitions. Second operand 15 states. [2020-07-29 02:05:12,788 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 15 states. [2020-07-29 02:05:12,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:05:12,789 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-07-29 02:05:12,789 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2020-07-29 02:05:12,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:12,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:12,790 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 20 states and 22 transitions. [2020-07-29 02:05:12,790 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 20 states and 22 transitions. [2020-07-29 02:05:12,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:05:12,791 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-07-29 02:05:12,791 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2020-07-29 02:05:12,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:12,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:12,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:05:12,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:05:12,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 02:05:12,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2020-07-29 02:05:12,793 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-07-29 02:05:12,793 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-07-29 02:05:12,793 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 02:05:12,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2020-07-29 02:05:12,793 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 02:05:12,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:12,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:12,794 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 02:05:12,794 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 02:05:12,794 INFO L794 eck$LassoCheckResult]: Stem: 226#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 224#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0; 214#L15 assume !!(main_~MAX~0 > 0); 215#L15-2 call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 220#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 221#L20-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 222#L20-3 assume !(main_~i~0 < main_~MAX~0); 218#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 219#L27-3 [2020-07-29 02:05:12,794 INFO L796 eck$LassoCheckResult]: Loop: 219#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 228#L27-2 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 219#L27-3 [2020-07-29 02:05:12,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:12,795 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2020-07-29 02:05:12,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:12,795 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675923390] [2020-07-29 02:05:12,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:12,826 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:12,866 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:12,872 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:12,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:12,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1955, now seen corresponding path program 2 times [2020-07-29 02:05:12,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:12,879 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769929197] [2020-07-29 02:05:12,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:12,892 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:12,901 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:12,904 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:12,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:12,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811567, now seen corresponding path program 1 times [2020-07-29 02:05:12,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:12,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803884638] [2020-07-29 02:05:12,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:12,949 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:12,970 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:12,975 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:13,300 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2020-07-29 02:05:13,889 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2020-07-29 02:05:13,894 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:05:13,895 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:05:13,895 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:05:13,895 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:05:13,895 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:05:13,895 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:13,895 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:05:13,895 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:05:13,895 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-1.c_Iteration3_Lasso [2020-07-29 02:05:13,895 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:05:13,896 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:05:13,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:13,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:13,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:13,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:13,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:13,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:13,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:13,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:13,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:13,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:13,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:14,126 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 02:05:14,127 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 02:05:14,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:14,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:14,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:14,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:14,749 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:05:14,749 INFO L489 LassoAnalysis]: Using template 'affine'. 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 02:05:14,755 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 02:05:14,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:14,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:14,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:14,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:14,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:14,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:14,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:14,761 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 02:05:14,797 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 02:05:14,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:14,800 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:14,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:14,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:14,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:14,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:14,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:14,806 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 02:05:14,868 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 02:05:14,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:14,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:14,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:14,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:14,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:14,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:14,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:14,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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:14,903 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 02:05:14,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:14,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:14,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:14,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:14,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:05:14,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 02:05:14,911 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:14,933 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 02:05:14,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:14,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:14,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:14,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:14,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:14,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:14,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:14,938 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:05:14,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 02:05:14,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:14,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:14,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:14,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:14,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:14,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:14,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:14,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 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 02:05:15,016 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 02:05:15,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:15,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:15,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:15,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:15,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:15,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:15,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:15,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:15,043 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 02:05:15,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:15,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:15,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:15,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:15,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:05:15,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 02:05:15,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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:15,087 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 02:05:15,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:15,088 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:15,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:15,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:15,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:15,089 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:15,089 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:15,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:15,115 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 02:05:15,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:15,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:15,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:15,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:15,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:15,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:15,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:15,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:05:15,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:05:15,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:15,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:15,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:15,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:15,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:05:15,169 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:15,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:15,207 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 02:05:15,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:15,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:15,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:15,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:15,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:05:15,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 02:05:15,234 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:05:15,289 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2020-07-29 02:05:15,289 INFO L444 ModelExtractionUtils]: 2 out of 25 variables were initially zero. Simplification set additionally 19 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:05:15,293 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:15,296 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 02:05:15,296 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:05:15,297 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#str2~0.offset, ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~#str2~0.base)_2) = -1*ULTIMATE.start_main_~#str2~0.offset - 1*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~#str2~0.base)_2 Supporting invariants [] [2020-07-29 02:05:15,349 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 02:05:15,353 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 >= 0);call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5;" "main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3;" [2020-07-29 02:05:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:15,358 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 02:05:15,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:15,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:05:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:15,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:05:15,395 INFO L280 TraceCheckUtils]: 0: Hoare triple {278#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {278#unseeded} is VALID [2020-07-29 02:05:15,396 INFO L280 TraceCheckUtils]: 1: Hoare triple {278#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0; {278#unseeded} is VALID [2020-07-29 02:05:15,397 INFO L280 TraceCheckUtils]: 2: Hoare triple {278#unseeded} assume !!(main_~MAX~0 > 0); {278#unseeded} is VALID [2020-07-29 02:05:15,397 INFO L280 TraceCheckUtils]: 3: Hoare triple {278#unseeded} call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; {278#unseeded} is VALID [2020-07-29 02:05:15,398 INFO L280 TraceCheckUtils]: 4: Hoare triple {278#unseeded} assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; {278#unseeded} is VALID [2020-07-29 02:05:15,399 INFO L280 TraceCheckUtils]: 5: Hoare triple {278#unseeded} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {278#unseeded} is VALID [2020-07-29 02:05:15,399 INFO L280 TraceCheckUtils]: 6: Hoare triple {278#unseeded} assume !(main_~i~0 < main_~MAX~0); {278#unseeded} is VALID [2020-07-29 02:05:15,400 INFO L280 TraceCheckUtils]: 7: Hoare triple {278#unseeded} call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; {278#unseeded} is VALID [2020-07-29 02:05:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:15,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:05:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:15,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:05:15,472 INFO L280 TraceCheckUtils]: 0: Hoare triple {281#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~#str2~0.offset|) (* (- 1) ULTIMATE.start_main_~j~0) (select |#length| |ULTIMATE.start_main_~#str2~0.base|)))} assume !!(main_~i~0 >= 0);call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; {332#(and (<= (+ (select |#length| |ULTIMATE.start_main_~#str2~0.base|) 1) (+ oldRank0 |ULTIMATE.start_main_~#str2~0.offset| ULTIMATE.start_main_~j~0)) (<= 1 oldRank0))} is VALID [2020-07-29 02:05:15,473 INFO L280 TraceCheckUtils]: 1: Hoare triple {332#(and (<= (+ (select |#length| |ULTIMATE.start_main_~#str2~0.base|) 1) (+ oldRank0 |ULTIMATE.start_main_~#str2~0.offset| ULTIMATE.start_main_~j~0)) (<= 1 oldRank0))} main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; {306#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~#str2~0.offset|) (* (- 1) ULTIMATE.start_main_~j~0) (select |#length| |ULTIMATE.start_main_~#str2~0.base|)))) unseeded)} is VALID [2020-07-29 02:05:15,474 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 02:05:15,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:05:15,482 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 02:05:15,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 02:05:15,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,483 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 02:05:15,483 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 02:05:15,518 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 19 states and 23 transitions. Complement of second has 5 states. [2020-07-29 02:05:15,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 02:05:15,519 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:05:15,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 02:05:15,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:15,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:15,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 02:05:15,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:05:15,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:15,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:15,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2020-07-29 02:05:15,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:05:15,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:15,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:15,523 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 17 transitions. cyclomatic complexity: 5 [2020-07-29 02:05:15,524 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 02:05:15,525 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 02:05:15,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:05:15,526 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:05:15,526 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 23 transitions. cyclomatic complexity: 7 [2020-07-29 02:05:15,527 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 02:05:15,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2020-07-29 02:05:15,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 02:05:15,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2020-07-29 02:05:15,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:05:15,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:05:15,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:05:15,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 4 letters. [2020-07-29 02:05:15,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 02:05:15,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 4 letters. [2020-07-29 02:05:15,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 19 letters. [2020-07-29 02:05:15,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 02:05:15,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 19 letters. Loop has 19 letters. [2020-07-29 02:05:15,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:05:15,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:05:15,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 15 letters. [2020-07-29 02:05:15,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:05:15,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:05:15,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:05:15,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 4 letters. [2020-07-29 02:05:15,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 02:05:15,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 4 letters. [2020-07-29 02:05:15,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 4 letters. [2020-07-29 02:05:15,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 02:05:15,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 4 letters. [2020-07-29 02:05:15,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 4 letters. [2020-07-29 02:05:15,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 02:05:15,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 4 letters. [2020-07-29 02:05:15,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 4 letters. [2020-07-29 02:05:15,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 02:05:15,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 4 letters. [2020-07-29 02:05:15,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:05:15,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:05:15,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 02:05:15,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2020-07-29 02:05:15,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 02:05:15,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2020-07-29 02:05:15,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:05:15,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:05:15,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 02:05:15,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 4 letters. [2020-07-29 02:05:15,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 02:05:15,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 4 letters. [2020-07-29 02:05:15,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 4 letters. [2020-07-29 02:05:15,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 02:05:15,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 4 letters. [2020-07-29 02:05:15,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 4 letters. [2020-07-29 02:05:15,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 02:05:15,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 4 letters. [2020-07-29 02:05:15,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 4 letters. [2020-07-29 02:05:15,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 02:05:15,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 23 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 4 letters. [2020-07-29 02:05:15,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,548 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:05:15,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 02:05:15,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2020-07-29 02:05:15,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 8 letters. Loop has 2 letters. [2020-07-29 02:05:15,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 2 letters. [2020-07-29 02:05:15,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-29 02:05:15,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:15,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 23 transitions. cyclomatic complexity: 7 [2020-07-29 02:05:15,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:05:15,553 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 21 transitions. [2020-07-29 02:05:15,553 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 02:05:15,553 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 02:05:15,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2020-07-29 02:05:15,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:05:15,554 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-07-29 02:05:15,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2020-07-29 02:05:15,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-07-29 02:05:15,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:05:15,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 21 transitions. Second operand 17 states. [2020-07-29 02:05:15,556 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 21 transitions. Second operand 17 states. [2020-07-29 02:05:15,556 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 17 states. [2020-07-29 02:05:15,557 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:05:15,560 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-07-29 02:05:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2020-07-29 02:05:15,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:15,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:15,561 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states and 21 transitions. [2020-07-29 02:05:15,561 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states and 21 transitions. [2020-07-29 02:05:15,562 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:05:15,563 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-07-29 02:05:15,564 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2020-07-29 02:05:15,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:15,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:15,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:05:15,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:05:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 02:05:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2020-07-29 02:05:15,566 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-29 02:05:15,566 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-29 02:05:15,566 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 02:05:15,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2020-07-29 02:05:15,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:05:15,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:15,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:15,568 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 02:05:15,568 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 02:05:15,568 INFO L794 eck$LassoCheckResult]: Stem: 374#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 373#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0; 362#L15 assume !!(main_~MAX~0 > 0); 363#L15-2 call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 368#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 369#L20-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 370#L20-3 assume !(main_~i~0 < main_~MAX~0); 366#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 367#L27-3 assume !(main_~i~0 >= 0); 375#L27-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 371#L33-3 [2020-07-29 02:05:15,568 INFO L796 eck$LassoCheckResult]: Loop: 371#L33-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem7 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem8 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem7 == main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 364#L5 assume !(0 == __VERIFIER_assert_~cond); 365#L5-2 havoc main_#t~mem8;havoc main_#t~mem7;main_#t~post9 := main_~j~0;main_~j~0 := main_#t~post9 - 1;havoc main_#t~post9; 372#L33-2 main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 371#L33-3 [2020-07-29 02:05:15,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:15,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1899811625, now seen corresponding path program 1 times [2020-07-29 02:05:15,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:15,569 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569434520] [2020-07-29 02:05:15,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:15,605 INFO L280 TraceCheckUtils]: 0: Hoare triple {479#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {479#true} is VALID [2020-07-29 02:05:15,606 INFO L280 TraceCheckUtils]: 1: Hoare triple {479#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0; {479#true} is VALID [2020-07-29 02:05:15,607 INFO L280 TraceCheckUtils]: 2: Hoare triple {479#true} assume !!(main_~MAX~0 > 0); {481#(<= 1 ULTIMATE.start_main_~MAX~0)} is VALID [2020-07-29 02:05:15,607 INFO L280 TraceCheckUtils]: 3: Hoare triple {481#(<= 1 ULTIMATE.start_main_~MAX~0)} call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; {481#(<= 1 ULTIMATE.start_main_~MAX~0)} is VALID [2020-07-29 02:05:15,608 INFO L280 TraceCheckUtils]: 4: Hoare triple {481#(<= 1 ULTIMATE.start_main_~MAX~0)} assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; {481#(<= 1 ULTIMATE.start_main_~MAX~0)} is VALID [2020-07-29 02:05:15,608 INFO L280 TraceCheckUtils]: 5: Hoare triple {481#(<= 1 ULTIMATE.start_main_~MAX~0)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {481#(<= 1 ULTIMATE.start_main_~MAX~0)} is VALID [2020-07-29 02:05:15,609 INFO L280 TraceCheckUtils]: 6: Hoare triple {481#(<= 1 ULTIMATE.start_main_~MAX~0)} assume !(main_~i~0 < main_~MAX~0); {481#(<= 1 ULTIMATE.start_main_~MAX~0)} is VALID [2020-07-29 02:05:15,610 INFO L280 TraceCheckUtils]: 7: Hoare triple {481#(<= 1 ULTIMATE.start_main_~MAX~0)} call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; {482#(<= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 02:05:15,611 INFO L280 TraceCheckUtils]: 8: Hoare triple {482#(<= 0 ULTIMATE.start_main_~i~0)} assume !(main_~i~0 >= 0); {480#false} is VALID [2020-07-29 02:05:15,611 INFO L280 TraceCheckUtils]: 9: Hoare triple {480#false} main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; {480#false} is VALID [2020-07-29 02:05:15,612 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 02:05:15,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569434520] [2020-07-29 02:05:15,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 02:05:15,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 02:05:15,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231150678] [2020-07-29 02:05:15,613 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 02:05:15,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:15,614 INFO L82 PathProgramCache]: Analyzing trace with hash 2315850, now seen corresponding path program 1 times [2020-07-29 02:05:15,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:15,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742569377] [2020-07-29 02:05:15,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:15,620 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:15,625 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:15,627 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:15,806 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2020-07-29 02:05:15,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:05:15,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 02:05:15,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 02:05:15,810 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-07-29 02:05:15,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:05:15,892 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-29 02:05:15,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 02:05:15,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 02:05:15,908 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 02:05:15,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2020-07-29 02:05:15,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:05:15,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2020-07-29 02:05:15,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 02:05:15,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 02:05:15,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2020-07-29 02:05:15,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:05:15,912 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-07-29 02:05:15,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2020-07-29 02:05:15,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-07-29 02:05:15,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:05:15,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 19 transitions. Second operand 17 states. [2020-07-29 02:05:15,913 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 19 transitions. Second operand 17 states. [2020-07-29 02:05:15,913 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 17 states. [2020-07-29 02:05:15,914 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:05:15,915 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-29 02:05:15,915 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-29 02:05:15,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:15,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:15,916 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states and 19 transitions. [2020-07-29 02:05:15,916 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states and 19 transitions. [2020-07-29 02:05:15,916 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:05:15,918 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-29 02:05:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-29 02:05:15,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:15,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:15,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:05:15,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:05:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 02:05:15,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-07-29 02:05:15,919 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-07-29 02:05:15,919 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-07-29 02:05:15,919 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 02:05:15,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2020-07-29 02:05:15,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:05:15,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:15,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:15,920 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 02:05:15,920 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 02:05:15,921 INFO L794 eck$LassoCheckResult]: Stem: 516#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 514#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0; 504#L15 assume !!(main_~MAX~0 > 0); 505#L15-2 call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 510#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 511#L20-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 512#L20-3 assume !(main_~i~0 < main_~MAX~0); 508#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 509#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 520#L27-2 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 518#L27-3 assume !(main_~i~0 >= 0); 517#L27-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 513#L33-3 [2020-07-29 02:05:15,921 INFO L796 eck$LassoCheckResult]: Loop: 513#L33-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem7 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem8 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem7 == main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 506#L5 assume !(0 == __VERIFIER_assert_~cond); 507#L5-2 havoc main_#t~mem8;havoc main_#t~mem7;main_#t~post9 := main_~j~0;main_~j~0 := main_#t~post9 - 1;havoc main_#t~post9; 515#L33-2 main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 513#L33-3 [2020-07-29 02:05:15,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:15,921 INFO L82 PathProgramCache]: Analyzing trace with hash -357814151, now seen corresponding path program 1 times [2020-07-29 02:05:15,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:15,922 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320587792] [2020-07-29 02:05:15,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:15,941 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:15,957 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:15,962 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:15,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:15,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2315850, now seen corresponding path program 2 times [2020-07-29 02:05:15,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:15,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659085995] [2020-07-29 02:05:15,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:15,968 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:15,973 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:15,975 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:15,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:15,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1607633602, now seen corresponding path program 1 times [2020-07-29 02:05:15,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:15,976 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974392342] [2020-07-29 02:05:15,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:15,996 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:16,024 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:16,034 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:16,559 WARN L193 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 101 [2020-07-29 02:05:17,074 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2020-07-29 02:05:17,079 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:05:17,079 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:05:17,079 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:05:17,080 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:05:17,080 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:05:17,080 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:17,080 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:05:17,080 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:05:17,080 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-1.c_Iteration5_Lasso [2020-07-29 02:05:17,080 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:05:17,080 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:05:17,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:17,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:17,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:17,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:17,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:17,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:17,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:17,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:17,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:17,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:17,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:17,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 02:05:17,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:17,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:17,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:17,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:17,355 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2020-07-29 02:05:17,404 WARN L257 bleTransFormulaUtils]: 3 quantified variables [2020-07-29 02:05:17,405 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 02:05:17,795 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2020-07-29 02:05:18,209 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:05:18,209 INFO L489 LassoAnalysis]: Using template 'affine'. 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 02:05:18,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 02:05:18,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:18,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:18,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:18,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:18,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:18,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:18,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:18,217 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 02:05:18,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 02:05:18,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:18,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:18,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:18,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:18,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:05:18,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 02:05:18,249 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:05:18,285 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 02:05:18,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:18,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:18,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:18,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:18,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:18,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:18,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:18,289 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:18,322 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 02:05:18,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:18,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:18,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:18,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:18,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:18,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:18,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:18,329 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 02:05:18,356 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:18,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:18,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:18,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:18,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:18,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:05:18,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 02:05:18,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:05:18,403 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 02:05:18,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:18,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:18,405 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:18,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:18,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:05:18,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:18,413 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 02:05:18,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:05:18,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:18,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:18,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:18,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:18,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:18,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:18,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:18,443 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 02:05:18,465 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 02:05:18,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:18,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:18,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:18,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:18,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:18,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:18,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:18,468 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 02:05:18,494 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 02:05:18,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:18,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:18,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:18,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:18,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:18,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:18,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:18,497 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 02:05:18,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 02:05:18,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:18,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:18,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:18,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:18,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:18,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:18,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:18,523 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 02:05:18,546 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 02:05:18,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:18,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:18,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:18,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:18,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:18,549 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:18,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:18,550 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 02:05:18,574 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 02:05:18,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:18,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:18,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:18,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:18,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:18,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:18,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:18,579 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 02:05:18,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 02:05:18,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:18,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:18,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:18,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:18,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:18,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:18,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:18,606 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 02:05:18,628 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 02:05:18,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:18,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:18,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:18,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:18,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:18,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:18,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:18,633 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 02:05:18,656 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 02:05:18,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:18,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:05:18,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:18,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:18,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:18,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:05:18,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:05:18,660 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 02:05:18,683 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 02:05:18,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:18,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:18,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:18,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:18,688 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:05:18,688 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 02:05:18,693 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:18,715 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 02:05:18,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:05:18,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:05:18,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:05:18,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:05:18,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 02:05:18,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 02:05:18,741 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:05:18,782 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-07-29 02:05:18,782 INFO L444 ModelExtractionUtils]: 3 out of 25 variables were initially zero. Simplification set additionally 19 variables to zero. 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 02:05:18,793 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:05:18,795 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 02:05:18,796 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:05:18,796 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#str2~0.base)_3) = -2*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#str2~0.base)_3 Supporting invariants [] [2020-07-29 02:05:18,845 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 02:05:18,850 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem7 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem8 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem7 == main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;" "assume !(0 == __VERIFIER_assert_~cond);" "havoc main_#t~mem8;havoc main_#t~mem7;main_#t~post9 := main_~j~0;main_~j~0 := main_#t~post9 - 1;havoc main_#t~post9;" "main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6;" [2020-07-29 02:05:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:18,856 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 02:05:18,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:18,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 02:05:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:18,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:05:19,093 INFO L280 TraceCheckUtils]: 0: Hoare triple {620#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {620#unseeded} is VALID [2020-07-29 02:05:19,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {620#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0; {620#unseeded} is VALID [2020-07-29 02:05:19,095 INFO L280 TraceCheckUtils]: 2: Hoare triple {620#unseeded} assume !!(main_~MAX~0 > 0); {669#(and unseeded (< 0 ULTIMATE.start_main_~MAX~0))} is VALID [2020-07-29 02:05:19,096 INFO L280 TraceCheckUtils]: 3: Hoare triple {669#(and unseeded (< 0 ULTIMATE.start_main_~MAX~0))} call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; {673#(and (<= ULTIMATE.start_main_~i~0 0) unseeded (< 0 ULTIMATE.start_main_~MAX~0))} is VALID [2020-07-29 02:05:19,096 INFO L280 TraceCheckUtils]: 4: Hoare triple {673#(and (<= ULTIMATE.start_main_~i~0 0) unseeded (< 0 ULTIMATE.start_main_~MAX~0))} assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; {673#(and (<= ULTIMATE.start_main_~i~0 0) unseeded (< 0 ULTIMATE.start_main_~MAX~0))} is VALID [2020-07-29 02:05:19,097 INFO L280 TraceCheckUtils]: 5: Hoare triple {673#(and (<= ULTIMATE.start_main_~i~0 0) unseeded (< 0 ULTIMATE.start_main_~MAX~0))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {680#(and unseeded (< 0 ULTIMATE.start_main_~MAX~0) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 02:05:19,098 INFO L280 TraceCheckUtils]: 6: Hoare triple {680#(and unseeded (< 0 ULTIMATE.start_main_~MAX~0) (<= ULTIMATE.start_main_~i~0 1))} assume !(main_~i~0 < main_~MAX~0); {654#(and (= |ULTIMATE.start_main_~#str1~0.offset| (+ ULTIMATE.start_main_~MAX~0 |ULTIMATE.start_main_~#str1~0.offset| (- 1))) unseeded)} is VALID [2020-07-29 02:05:19,098 INFO L280 TraceCheckUtils]: 7: Hoare triple {654#(and (= |ULTIMATE.start_main_~#str1~0.offset| (+ ULTIMATE.start_main_~MAX~0 |ULTIMATE.start_main_~#str1~0.offset| (- 1))) unseeded)} call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; {654#(and (= |ULTIMATE.start_main_~#str1~0.offset| (+ ULTIMATE.start_main_~MAX~0 |ULTIMATE.start_main_~#str1~0.offset| (- 1))) unseeded)} is VALID [2020-07-29 02:05:19,099 INFO L280 TraceCheckUtils]: 8: Hoare triple {654#(and (= |ULTIMATE.start_main_~#str1~0.offset| (+ ULTIMATE.start_main_~MAX~0 |ULTIMATE.start_main_~#str1~0.offset| (- 1))) unseeded)} assume !!(main_~i~0 >= 0);call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; {654#(and (= |ULTIMATE.start_main_~#str1~0.offset| (+ ULTIMATE.start_main_~MAX~0 |ULTIMATE.start_main_~#str1~0.offset| (- 1))) unseeded)} is VALID [2020-07-29 02:05:19,100 INFO L280 TraceCheckUtils]: 9: Hoare triple {654#(and (= |ULTIMATE.start_main_~#str1~0.offset| (+ ULTIMATE.start_main_~MAX~0 |ULTIMATE.start_main_~#str1~0.offset| (- 1))) unseeded)} main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; {654#(and (= |ULTIMATE.start_main_~#str1~0.offset| (+ ULTIMATE.start_main_~MAX~0 |ULTIMATE.start_main_~#str1~0.offset| (- 1))) unseeded)} is VALID [2020-07-29 02:05:19,100 INFO L280 TraceCheckUtils]: 10: Hoare triple {654#(and (= |ULTIMATE.start_main_~#str1~0.offset| (+ ULTIMATE.start_main_~MAX~0 |ULTIMATE.start_main_~#str1~0.offset| (- 1))) unseeded)} assume !(main_~i~0 >= 0); {654#(and (= |ULTIMATE.start_main_~#str1~0.offset| (+ ULTIMATE.start_main_~MAX~0 |ULTIMATE.start_main_~#str1~0.offset| (- 1))) unseeded)} is VALID [2020-07-29 02:05:19,101 INFO L280 TraceCheckUtils]: 11: Hoare triple {654#(and (= |ULTIMATE.start_main_~#str1~0.offset| (+ ULTIMATE.start_main_~MAX~0 |ULTIMATE.start_main_~#str1~0.offset| (- 1))) unseeded)} main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; {654#(and (= |ULTIMATE.start_main_~#str1~0.offset| (+ ULTIMATE.start_main_~MAX~0 |ULTIMATE.start_main_~#str1~0.offset| (- 1))) unseeded)} is VALID [2020-07-29 02:05:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:19,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 02:05:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:19,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:05:19,197 INFO L280 TraceCheckUtils]: 0: Hoare triple {655#(and (>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) (select |#length| |ULTIMATE.start_main_~#str2~0.base|))) (= |ULTIMATE.start_main_~#str1~0.offset| (+ ULTIMATE.start_main_~MAX~0 |ULTIMATE.start_main_~#str1~0.offset| (- 1))))} assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem7 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem8 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem7 == main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {699#(and (= 1 ULTIMATE.start_main_~MAX~0) (<= (select |#length| |ULTIMATE.start_main_~#str2~0.base|) (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (<= 1 (select |#length| |ULTIMATE.start_main_~#str2~0.base|)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~MAX~0))} is VALID [2020-07-29 02:05:19,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {699#(and (= 1 ULTIMATE.start_main_~MAX~0) (<= (select |#length| |ULTIMATE.start_main_~#str2~0.base|) (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (<= 1 (select |#length| |ULTIMATE.start_main_~#str2~0.base|)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~MAX~0))} assume !(0 == __VERIFIER_assert_~cond); {699#(and (= 1 ULTIMATE.start_main_~MAX~0) (<= (select |#length| |ULTIMATE.start_main_~#str2~0.base|) (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (<= 1 (select |#length| |ULTIMATE.start_main_~#str2~0.base|)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~MAX~0))} is VALID [2020-07-29 02:05:19,198 INFO L280 TraceCheckUtils]: 2: Hoare triple {699#(and (= 1 ULTIMATE.start_main_~MAX~0) (<= (select |#length| |ULTIMATE.start_main_~#str2~0.base|) (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (<= 1 (select |#length| |ULTIMATE.start_main_~#str2~0.base|)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~MAX~0))} havoc main_#t~mem8;havoc main_#t~mem7;main_#t~post9 := main_~j~0;main_~j~0 := main_#t~post9 - 1;havoc main_#t~post9; {699#(and (= 1 ULTIMATE.start_main_~MAX~0) (<= (select |#length| |ULTIMATE.start_main_~#str2~0.base|) (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (<= 1 (select |#length| |ULTIMATE.start_main_~#str2~0.base|)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~MAX~0))} is VALID [2020-07-29 02:05:19,199 INFO L280 TraceCheckUtils]: 3: Hoare triple {699#(and (= 1 ULTIMATE.start_main_~MAX~0) (<= (select |#length| |ULTIMATE.start_main_~#str2~0.base|) (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (<= 1 (select |#length| |ULTIMATE.start_main_~#str2~0.base|)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~MAX~0))} main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; {657#(and (= |ULTIMATE.start_main_~#str1~0.offset| (+ ULTIMATE.start_main_~MAX~0 |ULTIMATE.start_main_~#str1~0.offset| (- 1))) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) (select |#length| |ULTIMATE.start_main_~#str2~0.base|)))) unseeded))} is VALID [2020-07-29 02:05:19,200 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 02:05:19,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 02:05:19,223 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 02:05:19,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 02:05:19,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,223 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2020-07-29 02:05:19,224 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 5 Second operand 7 states. [2020-07-29 02:05:19,515 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 36 states and 41 transitions. Complement of second has 11 states. [2020-07-29 02:05:19,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2020-07-29 02:05:19,516 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:05:19,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. cyclomatic complexity: 5 [2020-07-29 02:05:19,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:19,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:19,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 02:05:19,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:05:19,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:19,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:19,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2020-07-29 02:05:19,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:05:19,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:19,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:19,521 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 19 transitions. cyclomatic complexity: 5 [2020-07-29 02:05:19,522 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 02:05:19,522 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 02:05:19,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 02:05:19,531 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:05:19,531 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 41 transitions. cyclomatic complexity: 10 [2020-07-29 02:05:19,532 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 02:05:19,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 4 letters. [2020-07-29 02:05:19,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 02:05:19,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 41 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 4 letters. [2020-07-29 02:05:19,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:05:19,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:05:19,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 41 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:05:19,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 4 letters. [2020-07-29 02:05:19,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 02:05:19,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 41 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 4 letters. [2020-07-29 02:05:19,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 5 Stem has 36 letters. Loop has 36 letters. [2020-07-29 02:05:19,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 36 letters. Loop has 36 letters. [2020-07-29 02:05:19,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 41 transitions. cyclomatic complexity: 10 Stem has 36 letters. Loop has 36 letters. [2020-07-29 02:05:19,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 17 letters. [2020-07-29 02:05:19,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 02:05:19,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 41 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 17 letters. [2020-07-29 02:05:19,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 9 letters. [2020-07-29 02:05:19,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 02:05:19,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 41 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 9 letters. [2020-07-29 02:05:19,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 4 letters. [2020-07-29 02:05:19,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 02:05:19,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 41 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 4 letters. [2020-07-29 02:05:19,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 4 letters. [2020-07-29 02:05:19,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 02:05:19,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 41 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 4 letters. [2020-07-29 02:05:19,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 4 letters. [2020-07-29 02:05:19,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 02:05:19,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 41 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2020-07-29 02:05:19,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 4 letters. [2020-07-29 02:05:19,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 02:05:19,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 41 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 4 letters. [2020-07-29 02:05:19,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:05:19,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:05:19,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 41 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2020-07-29 02:05:19,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 5 Stem has 18 letters. Loop has 4 letters. [2020-07-29 02:05:19,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 02:05:19,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 41 transitions. cyclomatic complexity: 10 Stem has 18 letters. Loop has 4 letters. [2020-07-29 02:05:19,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 5 Stem has 19 letters. Loop has 4 letters. [2020-07-29 02:05:19,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 19 letters. Loop has 4 letters. [2020-07-29 02:05:19,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 41 transitions. cyclomatic complexity: 10 Stem has 19 letters. Loop has 4 letters. [2020-07-29 02:05:19,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 4 letters. [2020-07-29 02:05:19,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 02:05:19,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 41 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 4 letters. [2020-07-29 02:05:19,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 19 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 4 letters. [2020-07-29 02:05:19,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 02:05:19,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 41 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 4 letters. [2020-07-29 02:05:19,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,550 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:05:19,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 02:05:19,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2020-07-29 02:05:19,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 26 transitions. Stem has 12 letters. Loop has 4 letters. [2020-07-29 02:05:19,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 26 transitions. Stem has 16 letters. Loop has 4 letters. [2020-07-29 02:05:19,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 26 transitions. Stem has 12 letters. Loop has 8 letters. [2020-07-29 02:05:19,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:05:19,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 41 transitions. cyclomatic complexity: 10 [2020-07-29 02:05:19,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:05:19,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 22 states and 24 transitions. [2020-07-29 02:05:19,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 02:05:19,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 02:05:19,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2020-07-29 02:05:19,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:05:19,556 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-07-29 02:05:19,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2020-07-29 02:05:19,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2020-07-29 02:05:19,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:05:19,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 24 transitions. Second operand 19 states. [2020-07-29 02:05:19,558 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 24 transitions. Second operand 19 states. [2020-07-29 02:05:19,558 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 19 states. [2020-07-29 02:05:19,559 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:05:19,560 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-07-29 02:05:19,561 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-29 02:05:19,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:19,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:19,561 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 22 states and 24 transitions. [2020-07-29 02:05:19,561 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 22 states and 24 transitions. [2020-07-29 02:05:19,562 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:05:19,563 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-07-29 02:05:19,563 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-29 02:05:19,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:19,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:19,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:05:19,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:05:19,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 02:05:19,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-29 02:05:19,565 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-29 02:05:19,565 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-29 02:05:19,565 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 02:05:19,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2020-07-29 02:05:19,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:05:19,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:19,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:19,566 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 02:05:19,566 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 02:05:19,566 INFO L794 eck$LassoCheckResult]: Stem: 783#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 781#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0; 770#L15 assume !!(main_~MAX~0 > 0); 771#L15-2 call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 776#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 777#L20-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 778#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 779#L20-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 788#L20-3 assume !(main_~i~0 < main_~MAX~0); 774#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 775#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 787#L27-2 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 785#L27-3 assume !(main_~i~0 >= 0); 784#L27-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 780#L33-3 [2020-07-29 02:05:19,567 INFO L796 eck$LassoCheckResult]: Loop: 780#L33-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem7 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem8 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem7 == main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 772#L5 assume !(0 == __VERIFIER_assert_~cond); 773#L5-2 havoc main_#t~mem8;havoc main_#t~mem7;main_#t~post9 := main_~j~0;main_~j~0 := main_#t~post9 - 1;havoc main_#t~post9; 782#L33-2 main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 780#L33-3 [2020-07-29 02:05:19,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:19,567 INFO L82 PathProgramCache]: Analyzing trace with hash -793654437, now seen corresponding path program 2 times [2020-07-29 02:05:19,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:19,567 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394248348] [2020-07-29 02:05:19,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:19,646 INFO L280 TraceCheckUtils]: 0: Hoare triple {905#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {905#true} is VALID [2020-07-29 02:05:19,647 INFO L280 TraceCheckUtils]: 1: Hoare triple {905#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0; {905#true} is VALID [2020-07-29 02:05:19,648 INFO L280 TraceCheckUtils]: 2: Hoare triple {905#true} assume !!(main_~MAX~0 > 0); {905#true} is VALID [2020-07-29 02:05:19,649 INFO L280 TraceCheckUtils]: 3: Hoare triple {905#true} call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; {907#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 02:05:19,653 INFO L280 TraceCheckUtils]: 4: Hoare triple {907#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; {907#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 02:05:19,654 INFO L280 TraceCheckUtils]: 5: Hoare triple {907#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {908#(<= 1 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 02:05:19,656 INFO L280 TraceCheckUtils]: 6: Hoare triple {908#(<= 1 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; {909#(<= 2 ULTIMATE.start_main_~MAX~0)} is VALID [2020-07-29 02:05:19,656 INFO L280 TraceCheckUtils]: 7: Hoare triple {909#(<= 2 ULTIMATE.start_main_~MAX~0)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {909#(<= 2 ULTIMATE.start_main_~MAX~0)} is VALID [2020-07-29 02:05:19,657 INFO L280 TraceCheckUtils]: 8: Hoare triple {909#(<= 2 ULTIMATE.start_main_~MAX~0)} assume !(main_~i~0 < main_~MAX~0); {909#(<= 2 ULTIMATE.start_main_~MAX~0)} is VALID [2020-07-29 02:05:19,658 INFO L280 TraceCheckUtils]: 9: Hoare triple {909#(<= 2 ULTIMATE.start_main_~MAX~0)} call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; {908#(<= 1 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 02:05:19,659 INFO L280 TraceCheckUtils]: 10: Hoare triple {908#(<= 1 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 >= 0);call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; {908#(<= 1 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 02:05:19,660 INFO L280 TraceCheckUtils]: 11: Hoare triple {908#(<= 1 ULTIMATE.start_main_~i~0)} main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; {910#(<= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 02:05:19,661 INFO L280 TraceCheckUtils]: 12: Hoare triple {910#(<= 0 ULTIMATE.start_main_~i~0)} assume !(main_~i~0 >= 0); {906#false} is VALID [2020-07-29 02:05:19,661 INFO L280 TraceCheckUtils]: 13: Hoare triple {906#false} main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; {906#false} is VALID [2020-07-29 02:05:19,661 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:05:19,662 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394248348] [2020-07-29 02:05:19,662 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9062489] [2020-07-29 02:05:19,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 02:05:19,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 02:05:19,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 02:05:19,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 02:05:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:05:19,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:05:19,888 INFO L280 TraceCheckUtils]: 0: Hoare triple {905#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {905#true} is VALID [2020-07-29 02:05:19,888 INFO L280 TraceCheckUtils]: 1: Hoare triple {905#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0; {905#true} is VALID [2020-07-29 02:05:19,888 INFO L280 TraceCheckUtils]: 2: Hoare triple {905#true} assume !!(main_~MAX~0 > 0); {905#true} is VALID [2020-07-29 02:05:19,890 INFO L280 TraceCheckUtils]: 3: Hoare triple {905#true} call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; {910#(<= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 02:05:19,891 INFO L280 TraceCheckUtils]: 4: Hoare triple {910#(<= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; {910#(<= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 02:05:19,892 INFO L280 TraceCheckUtils]: 5: Hoare triple {910#(<= 0 ULTIMATE.start_main_~i~0)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {908#(<= 1 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 02:05:19,893 INFO L280 TraceCheckUtils]: 6: Hoare triple {908#(<= 1 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; {909#(<= 2 ULTIMATE.start_main_~MAX~0)} is VALID [2020-07-29 02:05:19,894 INFO L280 TraceCheckUtils]: 7: Hoare triple {909#(<= 2 ULTIMATE.start_main_~MAX~0)} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {909#(<= 2 ULTIMATE.start_main_~MAX~0)} is VALID [2020-07-29 02:05:19,895 INFO L280 TraceCheckUtils]: 8: Hoare triple {909#(<= 2 ULTIMATE.start_main_~MAX~0)} assume !(main_~i~0 < main_~MAX~0); {909#(<= 2 ULTIMATE.start_main_~MAX~0)} is VALID [2020-07-29 02:05:19,896 INFO L280 TraceCheckUtils]: 9: Hoare triple {909#(<= 2 ULTIMATE.start_main_~MAX~0)} call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; {908#(<= 1 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 02:05:19,897 INFO L280 TraceCheckUtils]: 10: Hoare triple {908#(<= 1 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 >= 0);call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; {908#(<= 1 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 02:05:19,897 INFO L280 TraceCheckUtils]: 11: Hoare triple {908#(<= 1 ULTIMATE.start_main_~i~0)} main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; {910#(<= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 02:05:19,898 INFO L280 TraceCheckUtils]: 12: Hoare triple {910#(<= 0 ULTIMATE.start_main_~i~0)} assume !(main_~i~0 >= 0); {906#false} is VALID [2020-07-29 02:05:19,898 INFO L280 TraceCheckUtils]: 13: Hoare triple {906#false} main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; {906#false} is VALID [2020-07-29 02:05:19,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:05:19,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 02:05:19,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2020-07-29 02:05:19,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303989891] [2020-07-29 02:05:19,900 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 02:05:19,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:19,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2315850, now seen corresponding path program 3 times [2020-07-29 02:05:19,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:19,901 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103479310] [2020-07-29 02:05:19,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:19,907 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:19,912 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:19,914 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:20,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:05:20,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 02:05:20,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-29 02:05:20,081 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 5 Second operand 6 states. [2020-07-29 02:05:20,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:05:20,260 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-07-29 02:05:20,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 02:05:20,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 02:05:20,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 02:05:20,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2020-07-29 02:05:20,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:05:20,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 27 transitions. [2020-07-29 02:05:20,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 02:05:20,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 02:05:20,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2020-07-29 02:05:20,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:05:20,286 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-29 02:05:20,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2020-07-29 02:05:20,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2020-07-29 02:05:20,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:05:20,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 27 transitions. Second operand 20 states. [2020-07-29 02:05:20,288 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 27 transitions. Second operand 20 states. [2020-07-29 02:05:20,289 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 20 states. [2020-07-29 02:05:20,290 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:05:20,292 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-29 02:05:20,292 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-29 02:05:20,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:20,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:20,294 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 25 states and 27 transitions. [2020-07-29 02:05:20,294 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 25 states and 27 transitions. [2020-07-29 02:05:20,295 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:05:20,302 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-29 02:05:20,307 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-29 02:05:20,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:05:20,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:05:20,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:05:20,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:05:20,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 02:05:20,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2020-07-29 02:05:20,308 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-07-29 02:05:20,309 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-07-29 02:05:20,309 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 02:05:20,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2020-07-29 02:05:20,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 02:05:20,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:05:20,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:05:20,310 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 02:05:20,310 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 02:05:20,310 INFO L794 eck$LassoCheckResult]: Stem: 997#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 996#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_#t~mem4, main_#t~post5, main_#t~post3, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~post6, main_~MAX~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~cont~0, main_~i~0, main_~j~0;main_~MAX~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0; 984#L15 assume !!(main_~MAX~0 > 0); 985#L15-2 call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack(main_~MAX~0);call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack(main_~MAX~0);havoc main_~cont~0;havoc main_~i~0;havoc main_~j~0;main_~cont~0 := 0;main_~i~0 := 0; 990#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 991#L20-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 992#L20-3 assume !!(main_~i~0 < main_~MAX~0);call write~int(main_#t~nondet2, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet2; 993#L20-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 1003#L20-3 assume !(main_~i~0 < main_~MAX~0); 988#L20-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (main_~MAX~0 - 1), 1);main_~j~0 := 0;main_~i~0 := main_~MAX~0 - 1; 989#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 999#L27-2 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 1000#L27-3 assume !!(main_~i~0 >= 0);call main_#t~mem4 := read~int(main_~#str1~0.base, main_~#str1~0.offset, 1);call write~int(main_#t~mem4, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem4;main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1001#L27-2 main_#t~post3 := main_~i~0;main_~i~0 := main_#t~post3 - 1;havoc main_#t~post3; 1002#L27-3 assume !(main_~i~0 >= 0); 998#L27-4 main_~j~0 := main_~MAX~0 - 1;main_~i~0 := 0; 994#L33-3 [2020-07-29 02:05:20,311 INFO L796 eck$LassoCheckResult]: Loop: 994#L33-3 assume !!(main_~i~0 < main_~MAX~0);call main_#t~mem7 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem8 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem7 == main_#t~mem8 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 986#L5 assume !(0 == __VERIFIER_assert_~cond); 987#L5-2 havoc main_#t~mem8;havoc main_#t~mem7;main_#t~post9 := main_~j~0;main_~j~0 := main_#t~post9 - 1;havoc main_#t~post9; 995#L33-2 main_#t~post6 := main_~i~0;main_~i~0 := 1 + main_#t~post6;havoc main_#t~post6; 994#L33-3 [2020-07-29 02:05:20,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:20,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1802321405, now seen corresponding path program 3 times [2020-07-29 02:05:20,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:20,311 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203704020] [2020-07-29 02:05:20,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:20,358 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:20,397 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:20,404 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:20,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:20,405 INFO L82 PathProgramCache]: Analyzing trace with hash 2315850, now seen corresponding path program 4 times [2020-07-29 02:05:20,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:20,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071779832] [2020-07-29 02:05:20,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:20,409 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:20,413 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:20,414 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:20,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:05:20,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1451832902, now seen corresponding path program 2 times [2020-07-29 02:05:20,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:05:20,415 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347220217] [2020-07-29 02:05:20,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:05:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:20,442 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:05:20,461 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:05:20,466 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:05:21,463 WARN L193 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 127 [2020-07-29 02:05:22,155 WARN L193 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 75 [2020-07-29 02:05:22,160 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:05:22,160 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:05:22,160 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:05:22,160 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:05:22,160 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:05:22,160 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:05:22,160 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:05:22,160 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:05:22,160 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-1.c_Iteration7_Lasso [2020-07-29 02:05:22,160 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:05:22,161 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:05:22,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:22,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:22,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 02:05:22,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 02:05:22,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:22,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:22,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:22,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:22,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 02:05:22,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:22,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:22,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:05:22,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 02:05:22,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 02:05:22,336 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-29 02:05:22,340 INFO L168 Benchmark]: Toolchain (without parser) took 14635.17 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 377.0 MB). Free memory was 956.2 MB in the beginning and 1.3 GB in the end (delta: -349.5 MB). Peak memory consumption was 432.6 MB. Max. memory is 11.5 GB. [2020-07-29 02:05:22,340 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 02:05:22,343 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.35 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 02:05:22,343 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -189.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 02:05:22,344 INFO L168 Benchmark]: Boogie Preprocessor took 30.14 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 02:05:22,344 INFO L168 Benchmark]: RCFGBuilder took 462.87 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: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2020-07-29 02:05:22,349 INFO L168 Benchmark]: BuchiAutomizer took 13718.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 232.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -197.0 MB). Peak memory consumption was 440.4 MB. Max. memory is 11.5 GB. [2020-07-29 02:05:22,352 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 298.35 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 119.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -189.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.14 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 462.87 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: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13718.48 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 232.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -197.0 MB). Peak memory consumption was 440.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...