./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/invert_string-3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-3.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 e0ffc577d494a5308847d196b5326d78dd21a5a9 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-9a8b2e8 [2020-10-20 07:03:32,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 07:03:32,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 07:03:33,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 07:03:33,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 07:03:33,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 07:03:33,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 07:03:33,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 07:03:33,017 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 07:03:33,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 07:03:33,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 07:03:33,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 07:03:33,022 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 07:03:33,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 07:03:33,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 07:03:33,027 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 07:03:33,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 07:03:33,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 07:03:33,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 07:03:33,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 07:03:33,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 07:03:33,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 07:03:33,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 07:03:33,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 07:03:33,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 07:03:33,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 07:03:33,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 07:03:33,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 07:03:33,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 07:03:33,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 07:03:33,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 07:03:33,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 07:03:33,056 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 07:03:33,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 07:03:33,065 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 07:03:33,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 07:03:33,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 07:03:33,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 07:03:33,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 07:03:33,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 07:03:33,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 07:03:33,074 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 07:03:33,100 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 07:03:33,100 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 07:03:33,101 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 07:03:33,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 07:03:33,102 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 07:03:33,102 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 07:03:33,102 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 07:03:33,102 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 07:03:33,102 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 07:03:33,103 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 07:03:33,103 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 07:03:33,103 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 07:03:33,103 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 07:03:33,103 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 07:03:33,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 07:03:33,104 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 07:03:33,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 07:03:33,104 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 07:03:33,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 07:03:33,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 07:03:33,105 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 07:03:33,105 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 07:03:33,105 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 07:03:33,105 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 07:03:33,105 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 07:03:33,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 07:03:33,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 07:03:33,106 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 07:03:33,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 07:03:33,106 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 07:03:33,106 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 07:03:33,107 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 07:03:33,108 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 07:03:33,108 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 -> e0ffc577d494a5308847d196b5326d78dd21a5a9 [2020-10-20 07:03:33,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 07:03:33,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 07:03:33,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 07:03:33,332 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 07:03:33,333 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 07:03:33,334 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/invert_string-3.c [2020-10-20 07:03:33,407 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73138c70e/547703c7acb544aea0cbb90b7f5937a0/FLAG5e5fe2338 [2020-10-20 07:03:33,906 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 07:03:33,906 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/invert_string-3.c [2020-10-20 07:03:33,912 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73138c70e/547703c7acb544aea0cbb90b7f5937a0/FLAG5e5fe2338 [2020-10-20 07:03:34,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73138c70e/547703c7acb544aea0cbb90b7f5937a0 [2020-10-20 07:03:34,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 07:03:34,263 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 07:03:34,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 07:03:34,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 07:03:34,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 07:03:34,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:03:34" (1/1) ... [2020-10-20 07:03:34,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bbfea5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:34, skipping insertion in model container [2020-10-20 07:03:34,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:03:34" (1/1) ... [2020-10-20 07:03:34,279 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 07:03:34,298 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 07:03:34,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:03:34,554 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 07:03:34,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:03:34,613 INFO L208 MainTranslator]: Completed translation [2020-10-20 07:03:34,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:34 WrapperNode [2020-10-20 07:03:34,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 07:03:34,614 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 07:03:34,614 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 07:03:34,614 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 07:03:34,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:34" (1/1) ... [2020-10-20 07:03:34,633 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:34" (1/1) ... [2020-10-20 07:03:34,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 07:03:34,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 07:03:34,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 07:03:34,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 07:03:34,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:34" (1/1) ... [2020-10-20 07:03:34,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:34" (1/1) ... [2020-10-20 07:03:34,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:34" (1/1) ... [2020-10-20 07:03:34,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:34" (1/1) ... [2020-10-20 07:03:34,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:34" (1/1) ... [2020-10-20 07:03:34,684 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:34" (1/1) ... [2020-10-20 07:03:34,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:34" (1/1) ... [2020-10-20 07:03:34,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 07:03:34,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 07:03:34,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 07:03:34,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 07:03:34,689 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:34" (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-10-20 07:03:34,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 07:03:34,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 07:03:34,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 07:03:34,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 07:03:34,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 07:03:34,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 07:03:34,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 07:03:35,075 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 07:03:35,076 INFO L298 CfgBuilder]: Removed 11 assume(true) statements. [2020-10-20 07:03:35,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:03:35 BoogieIcfgContainer [2020-10-20 07:03:35,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 07:03:35,078 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 07:03:35,078 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 07:03:35,082 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 07:03:35,083 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:03:35,084 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 07:03:34" (1/3) ... [2020-10-20 07:03:35,085 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42e255ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:03:35, skipping insertion in model container [2020-10-20 07:03:35,085 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:03:35,085 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:34" (2/3) ... [2020-10-20 07:03:35,085 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42e255ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:03:35, skipping insertion in model container [2020-10-20 07:03:35,086 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:03:35,086 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:03:35" (3/3) ... [2020-10-20 07:03:35,088 INFO L373 chiAutomizerObserver]: Analyzing ICFG invert_string-3.c [2020-10-20 07:03:35,137 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 07:03:35,138 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 07:03:35,138 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 07:03:35,138 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 07:03:35,138 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 07:03:35,139 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 07:03:35,139 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 07:03:35,139 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 07:03:35,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-10-20 07:03:35,189 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 07:03:35,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:35,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:35,198 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:03:35,199 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 07:03:35,199 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 07:03:35,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-10-20 07:03:35,203 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2020-10-20 07:03:35,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:35,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:35,204 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:03:35,204 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 07:03:35,215 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 10#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 3#L18-3true [2020-10-20 07:03:35,216 INFO L796 eck$LassoCheckResult]: Loop: 3#L18-3true assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 4#L18-2true main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 3#L18-3true [2020-10-20 07:03:35,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:35,223 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 07:03:35,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:35,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794525891] [2020-10-20 07:03:35,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:35,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:35,362 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:35,390 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:35,419 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:35,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:35,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-10-20 07:03:35,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:35,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940909187] [2020-10-20 07:03:35,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:35,453 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:35,470 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:35,473 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:35,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:35,476 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-10-20 07:03:35,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:35,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847266804] [2020-10-20 07:03:35,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:35,523 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:35,551 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:35,557 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:36,096 WARN L193 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2020-10-20 07:03:36,432 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2020-10-20 07:03:36,446 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:03:36,447 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:03:36,447 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:03:36,447 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:03:36,447 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:03:36,448 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:36,448 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:03:36,448 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:03:36,449 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration1_Lasso [2020-10-20 07:03:36,450 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:03:36,450 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:03:36,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:36,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:36,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:36,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:36,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:36,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:36,783 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2020-10-20 07:03:36,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:36,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:36,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:36,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:36,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:36,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:36,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:36,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:36,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:36,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:37,288 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:03:37,294 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-10-20 07:03:37,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 07:03:37,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:37,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:37,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:37,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:37,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:37,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:37,321 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-10-20 07:03:37,325 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:03:37,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:37,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:37,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:37,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:37,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:37,394 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:37,394 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:37,399 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-10-20 07:03:37,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:37,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:37,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:37,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:37,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:37,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:37,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:37,454 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-10-20 07:03:37,497 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 07:03:37,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:37,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:37,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:37,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:37,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:37,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:37,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:37,502 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-10-20 07:03:37,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 07:03:37,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:37,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:37,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:37,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:37,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:37,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:37,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:37,549 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:03:37,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:37,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:37,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:37,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:37,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:37,596 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:37,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:37,602 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-10-20 07:03:37,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 07:03:37,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:37,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:37,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:37,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:37,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:37,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:37,655 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-10-20 07:03:37,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-10-20 07:03:37,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:37,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:37,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:37,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:37,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:37,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:37,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:37,689 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) [2020-10-20 07:03:37,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 07:03:37,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:37,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:37,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:37,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:37,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:37,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:37,751 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-10-20 07:03:37,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 07:03:37,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:37,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:37,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:37,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:37,804 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:37,805 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:37,810 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:03:37,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 07:03:37,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:37,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:37,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:37,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:37,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:37,866 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:37,870 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-10-20 07:03:37,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-10-20 07:03:37,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:37,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:37,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:37,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:37,927 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:37,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:37,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:37,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 07:03:37,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:37,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:37,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:37,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:37,971 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:37,971 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:37,975 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-20 07:03:38,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:38,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:38,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:38,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:38,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:38,012 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:38,012 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:38,020 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-10-20 07:03:38,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-10-20 07:03:38,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:38,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:38,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:38,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:38,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:38,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:38,054 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-10-20 07:03:38,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:38,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:38,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:38,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:38,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:38,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:38,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:38,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:38,107 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-10-20 07:03:38,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 07:03:38,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:38,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:38,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:38,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:38,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:38,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:38,159 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) [2020-10-20 07:03:38,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 07:03:38,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:38,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:38,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:38,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:38,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:38,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:38,231 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-10-20 07:03:38,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 07:03:38,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:38,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:38,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:38,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:38,287 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:38,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:38,305 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:03:38,504 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-10-20 07:03:38,504 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 15 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) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:38,518 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:03:38,524 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-20 07:03:38,524 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:03:38,525 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-10-20 07:03:38,660 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2020-10-20 07:03:38,675 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 07:03:38,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:38,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 07:03:38,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:38,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 07:03:38,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:38,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:38,796 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-10-20 07:03:38,797 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2020-10-20 07:03:38,880 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 35 states and 49 transitions. Complement of second has 8 states. [2020-10-20 07:03:38,881 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-10-20 07:03:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 07:03:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-10-20 07:03:38,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2020-10-20 07:03:38,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:38,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-20 07:03:38,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:38,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-20 07:03:38,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:38,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 49 transitions. [2020-10-20 07:03:38,891 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:03:38,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 15 states and 20 transitions. [2020-10-20 07:03:38,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-10-20 07:03:38,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-20 07:03:38,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2020-10-20 07:03:38,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:03:38,899 INFO L691 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-20 07:03:38,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2020-10-20 07:03:38,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-10-20 07:03:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-20 07:03:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-10-20 07:03:38,929 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-20 07:03:38,929 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-10-20 07:03:38,929 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 07:03:38,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-10-20 07:03:38,930 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-10-20 07:03:38,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:38,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:38,931 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 07:03:38,931 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 07:03:38,931 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 176#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 166#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 167#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 179#L26-3 [2020-10-20 07:03:38,931 INFO L796 eck$LassoCheckResult]: Loop: 179#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 180#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 179#L26-3 [2020-10-20 07:03:38,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:38,932 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-10-20 07:03:38,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:38,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215110651] [2020-10-20 07:03:38,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:39,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:39,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215110651] [2020-10-20 07:03:39,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:03:39,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 07:03:39,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991077988] [2020-10-20 07:03:39,130 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:03:39,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:39,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2020-10-20 07:03:39,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:39,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395482475] [2020-10-20 07:03:39,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:39,137 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:39,143 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:39,145 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:39,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:03:39,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 07:03:39,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 07:03:39,205 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-10-20 07:03:39,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:39,244 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-10-20 07:03:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 07:03:39,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2020-10-20 07:03:39,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-20 07:03:39,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 16 transitions. [2020-10-20 07:03:39,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 07:03:39,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 07:03:39,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2020-10-20 07:03:39,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:03:39,247 INFO L691 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-10-20 07:03:39,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2020-10-20 07:03:39,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-10-20 07:03:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-20 07:03:39,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2020-10-20 07:03:39,250 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-10-20 07:03:39,250 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-10-20 07:03:39,250 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 07:03:39,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2020-10-20 07:03:39,251 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-20 07:03:39,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:39,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:39,252 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-20 07:03:39,252 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 07:03:39,253 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 202#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 203#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 204#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 205#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 206#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 212#L26-3 [2020-10-20 07:03:39,253 INFO L796 eck$LassoCheckResult]: Loop: 212#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 213#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 212#L26-3 [2020-10-20 07:03:39,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:39,253 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2020-10-20 07:03:39,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:39,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49952074] [2020-10-20 07:03:39,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:39,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49952074] [2020-10-20 07:03:39,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459537241] [2020-10-20 07:03:39,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:03:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:39,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 07:03:39,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:39,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:39,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:03:39,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-10-20 07:03:39,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304057852] [2020-10-20 07:03:39,447 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:03:39,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:39,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2020-10-20 07:03:39,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:39,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970382597] [2020-10-20 07:03:39,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:39,454 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:39,459 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:39,461 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:39,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:03:39,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 07:03:39,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-20 07:03:39,529 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 5 Second operand 6 states. [2020-10-20 07:03:39,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:39,618 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-10-20 07:03:39,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 07:03:39,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions. [2020-10-20 07:03:39,619 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-20 07:03:39,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 18 transitions. [2020-10-20 07:03:39,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 07:03:39,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 07:03:39,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions. [2020-10-20 07:03:39,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:03:39,623 INFO L691 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-10-20 07:03:39,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions. [2020-10-20 07:03:39,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-10-20 07:03:39,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-20 07:03:39,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2020-10-20 07:03:39,625 INFO L714 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-10-20 07:03:39,625 INFO L594 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-10-20 07:03:39,625 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 07:03:39,626 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2020-10-20 07:03:39,627 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-20 07:03:39,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:39,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:39,630 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-10-20 07:03:39,630 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 07:03:39,630 INFO L794 eck$LassoCheckResult]: Stem: 260#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 255#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 256#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 257#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 258#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 259#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 269#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 267#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 265#L26-3 [2020-10-20 07:03:39,630 INFO L796 eck$LassoCheckResult]: Loop: 265#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 266#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 265#L26-3 [2020-10-20 07:03:39,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:39,631 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2020-10-20 07:03:39,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:39,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150234029] [2020-10-20 07:03:39,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:39,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150234029] [2020-10-20 07:03:39,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451455160] [2020-10-20 07:03:39,832 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:03:39,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 07:03:39,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:03:39,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 07:03:39,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:39,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:39,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:03:39,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2020-10-20 07:03:39,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980867091] [2020-10-20 07:03:39,951 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:03:39,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:39,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2020-10-20 07:03:39,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:39,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514616525] [2020-10-20 07:03:39,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:39,958 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:39,962 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:39,964 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:40,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:03:40,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 07:03:40,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-20 07:03:40,023 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 5 Second operand 8 states. [2020-10-20 07:03:40,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:40,106 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2020-10-20 07:03:40,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 07:03:40,107 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2020-10-20 07:03:40,108 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-20 07:03:40,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 20 transitions. [2020-10-20 07:03:40,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 07:03:40,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 07:03:40,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2020-10-20 07:03:40,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:03:40,110 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-10-20 07:03:40,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2020-10-20 07:03:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-10-20 07:03:40,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-20 07:03:40,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-10-20 07:03:40,113 INFO L714 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-10-20 07:03:40,113 INFO L594 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-10-20 07:03:40,113 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 07:03:40,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2020-10-20 07:03:40,114 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-20 07:03:40,114 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:40,114 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:40,115 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2020-10-20 07:03:40,115 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 07:03:40,115 INFO L794 eck$LassoCheckResult]: Stem: 325#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 320#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 321#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 322#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 323#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 324#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 326#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 336#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 335#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 333#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 331#L26-3 [2020-10-20 07:03:40,115 INFO L796 eck$LassoCheckResult]: Loop: 331#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 332#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 331#L26-3 [2020-10-20 07:03:40,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:40,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2020-10-20 07:03:40,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:40,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52344839] [2020-10-20 07:03:40,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:40,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52344839] [2020-10-20 07:03:40,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337902454] [2020-10-20 07:03:40,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:03:40,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-20 07:03:40,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:03:40,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 07:03:40,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:40,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:40,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:03:40,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2020-10-20 07:03:40,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725045435] [2020-10-20 07:03:40,450 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:03:40,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:40,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2020-10-20 07:03:40,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:40,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891530087] [2020-10-20 07:03:40,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:40,456 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:40,459 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:40,461 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:40,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:03:40,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 07:03:40,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-20 07:03:40,509 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 5 Second operand 9 states. [2020-10-20 07:03:40,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:40,609 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2020-10-20 07:03:40,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 07:03:40,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2020-10-20 07:03:40,611 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-20 07:03:40,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2020-10-20 07:03:40,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 07:03:40,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 07:03:40,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2020-10-20 07:03:40,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:03:40,612 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2020-10-20 07:03:40,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2020-10-20 07:03:40,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-10-20 07:03:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-20 07:03:40,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-10-20 07:03:40,615 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-10-20 07:03:40,615 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-10-20 07:03:40,615 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 07:03:40,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2020-10-20 07:03:40,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-20 07:03:40,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:40,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:40,617 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2020-10-20 07:03:40,617 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 07:03:40,617 INFO L794 eck$LassoCheckResult]: Stem: 402#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 400#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 396#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 397#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 398#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 399#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 401#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 414#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 413#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 412#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 411#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 409#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 407#L26-3 [2020-10-20 07:03:40,618 INFO L796 eck$LassoCheckResult]: Loop: 407#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 408#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 407#L26-3 [2020-10-20 07:03:40,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:40,618 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2020-10-20 07:03:40,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:40,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469658931] [2020-10-20 07:03:40,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:40,803 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:40,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469658931] [2020-10-20 07:03:40,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305809541] [2020-10-20 07:03:40,804 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:03:40,844 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 07:03:40,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:03:40,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-20 07:03:40,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:40,937 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:40,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:03:40,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-10-20 07:03:40,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403884389] [2020-10-20 07:03:40,938 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:03:40,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:40,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2020-10-20 07:03:40,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:40,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535870677] [2020-10-20 07:03:40,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:40,945 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:40,948 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:40,950 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:41,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:03:41,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 07:03:41,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-20 07:03:41,008 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 5 Second operand 12 states. [2020-10-20 07:03:41,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:41,131 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-10-20 07:03:41,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 07:03:41,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2020-10-20 07:03:41,132 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-20 07:03:41,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 24 transitions. [2020-10-20 07:03:41,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 07:03:41,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-10-20 07:03:41,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2020-10-20 07:03:41,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:03:41,134 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-10-20 07:03:41,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2020-10-20 07:03:41,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-10-20 07:03:41,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-20 07:03:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2020-10-20 07:03:41,137 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-10-20 07:03:41,137 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-10-20 07:03:41,137 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 07:03:41,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2020-10-20 07:03:41,138 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-10-20 07:03:41,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:41,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:41,139 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2020-10-20 07:03:41,139 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 07:03:41,139 INFO L794 eck$LassoCheckResult]: Stem: 490#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 485#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 486#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 487#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 488#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 489#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 491#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 505#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 504#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 503#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 502#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 501#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 500#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 499#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 496#L26-3 [2020-10-20 07:03:41,139 INFO L796 eck$LassoCheckResult]: Loop: 496#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 497#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 496#L26-3 [2020-10-20 07:03:41,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:41,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2020-10-20 07:03:41,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:41,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076103255] [2020-10-20 07:03:41,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:41,161 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:41,180 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:41,187 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:41,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:41,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2020-10-20 07:03:41,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:41,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470036040] [2020-10-20 07:03:41,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:41,192 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:41,195 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:41,197 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:41,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:41,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425495, now seen corresponding path program 1 times [2020-10-20 07:03:41,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:41,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133874076] [2020-10-20 07:03:41,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:41,218 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:41,246 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:41,258 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:43,847 WARN L193 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 193 DAG size of output: 156 [2020-10-20 07:03:43,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 07:03:58,145 WARN L193 SmtUtils]: Spent 14.17 s on a formula simplification. DAG size of input: 204 DAG size of output: 114 [2020-10-20 07:03:58,154 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:03:58,154 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:03:58,154 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:03:58,154 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:03:58,155 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:03:58,155 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:58,155 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:03:58,155 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:03:58,155 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration7_Lasso [2020-10-20 07:03:58,155 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:03:58,155 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:03:58,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:58,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:58,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:58,796 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 70 [2020-10-20 07:03:58,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:58,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:58,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:58,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:58,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:58,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:58,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:58,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:58,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:58,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:58,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:58,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:03:59,146 WARN L193 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2020-10-20 07:03:59,402 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-20 07:03:59,524 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:03:59,525 INFO L489 LassoAnalysis]: Using template 'affine'. 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-10-20 07:03:59,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 07:03:59,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:59,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:59,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:59,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:59,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:59,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:59,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:59,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:59,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:59,563 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:59,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:59,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:59,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:59,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:59,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:59,565 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-10-20 07:03:59,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 07:03:59,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:59,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:59,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:59,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:59,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:59,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:59,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-20 07:03:59,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 07:03:59,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:59,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:59,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:59,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:59,628 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:59,629 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:59,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 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-10-20 07:03:59,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 07:03:59,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:59,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:59,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:59,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:59,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:59,661 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:59,665 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-10-20 07:03:59,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-10-20 07:03:59,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:59,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:59,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:59,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:59,701 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:59,701 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:59,715 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:03:59,760 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-10-20 07:03:59,760 INFO L444 ModelExtractionUtils]: 13 out of 28 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:59,763 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:03:59,765 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-20 07:03:59,765 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:03:59,766 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_2) = -1*ULTIMATE.start_main_~j~0 + 6442450943*v_rep(select #length ULTIMATE.start_main_~#str1~0.base)_2 Supporting invariants [-3*ULTIMATE.start_main_~i~0 - 2*ULTIMATE.start_main_~j~0 + 12884901885 >= 0] [2020-10-20 07:03:59,882 INFO L297 tatePredicateManager]: 16 out of 17 supporting invariants were superfluous and have been removed [2020-10-20 07:03:59,885 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 07:03:59,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:59,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 07:03:59,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:59,969 WARN L261 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 07:03:59,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:00,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:04:00,010 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-10-20 07:04:00,010 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-10-20 07:04:00,077 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 26 states and 30 transitions. Complement of second has 6 states. [2020-10-20 07:04:00,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2020-10-20 07:04:00,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 07:04:00,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2020-10-20 07:04:00,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 14 letters. Loop has 2 letters. [2020-10-20 07:04:00,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:04:00,080 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 07:04:00,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:00,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 07:04:00,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:00,172 WARN L261 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-20 07:04:00,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:00,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:04:00,208 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2020-10-20 07:04:00,208 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 5 Second operand 4 states. [2020-10-20 07:04:00,275 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 23 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 24 states and 29 transitions. Complement of second has 8 states. [2020-10-20 07:04:00,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-20 07:04:00,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-20 07:04:00,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 9 transitions. [2020-10-20 07:04:00,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 14 letters. Loop has 2 letters. [2020-10-20 07:04:00,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:04:00,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 16 letters. Loop has 2 letters. [2020-10-20 07:04:00,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:04:00,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 9 transitions. Stem has 14 letters. Loop has 4 letters. [2020-10-20 07:04:00,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:04:00,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2020-10-20 07:04:00,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 07:04:00,282 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 25 transitions. [2020-10-20 07:04:00,282 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-20 07:04:00,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-20 07:04:00,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2020-10-20 07:04:00,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:04:00,282 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-10-20 07:04:00,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2020-10-20 07:04:00,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-10-20 07:04:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-20 07:04:00,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2020-10-20 07:04:00,285 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-10-20 07:04:00,285 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2020-10-20 07:04:00,285 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 07:04:00,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2020-10-20 07:04:00,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 07:04:00,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:04:00,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:04:00,286 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2020-10-20 07:04:00,286 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 07:04:00,287 INFO L794 eck$LassoCheckResult]: Stem: 770#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 769#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 765#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 766#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 767#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 768#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 786#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 785#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 784#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 783#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 782#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 781#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 780#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 778#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 775#L26-3 assume !(main_~i~0 >= 0); 771#L26-4 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 772#L32-3 [2020-10-20 07:04:00,287 INFO L796 eck$LassoCheckResult]: Loop: 772#L32-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem13 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem14 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem13 == main_#t~mem14 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 773#L6 assume !(0 == __VERIFIER_assert_~cond); 774#L6-2 havoc main_#t~mem13;havoc main_#t~mem14;main_#t~post15 := main_~j~0;main_~j~0 := main_#t~post15 - 1;havoc main_#t~post15; 779#L32-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 772#L32-3 [2020-10-20 07:04:00,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:00,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425437, now seen corresponding path program 1 times [2020-10-20 07:04:00,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:00,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570952370] [2020-10-20 07:04:00,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:00,325 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-20 07:04:00,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570952370] [2020-10-20 07:04:00,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:04:00,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 07:04:00,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754888439] [2020-10-20 07:04:00,326 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:04:00,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:00,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2102348, now seen corresponding path program 1 times [2020-10-20 07:04:00,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:00,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29564199] [2020-10-20 07:04:00,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:00,333 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:00,355 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:00,357 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:00,558 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2020-10-20 07:04:00,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:04:00,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 07:04:00,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 07:04:00,560 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-10-20 07:04:00,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:04:00,602 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-10-20 07:04:00,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 07:04:00,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 24 transitions. [2020-10-20 07:04:00,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 07:04:00,604 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 24 transitions. [2020-10-20 07:04:00,604 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 07:04:00,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-20 07:04:00,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 24 transitions. [2020-10-20 07:04:00,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:04:00,605 INFO L691 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-10-20 07:04:00,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 24 transitions. [2020-10-20 07:04:00,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-10-20 07:04:00,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-20 07:04:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-10-20 07:04:00,607 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-10-20 07:04:00,607 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-10-20 07:04:00,607 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 07:04:00,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2020-10-20 07:04:00,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 07:04:00,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:04:00,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:04:00,609 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:04:00,609 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 07:04:00,609 INFO L794 eck$LassoCheckResult]: Stem: 823#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 822#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 818#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 819#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 820#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 821#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 839#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 838#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 837#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 836#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 835#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 834#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 833#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 831#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 828#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 829#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 830#L26-3 assume !(main_~i~0 >= 0); 824#L26-4 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 825#L32-3 [2020-10-20 07:04:00,609 INFO L796 eck$LassoCheckResult]: Loop: 825#L32-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem13 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem14 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem13 == main_#t~mem14 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 826#L6 assume !(0 == __VERIFIER_assert_~cond); 827#L6-2 havoc main_#t~mem13;havoc main_#t~mem14;main_#t~post15 := main_~j~0;main_~j~0 := main_#t~post15 - 1;havoc main_#t~post15; 832#L32-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 825#L32-3 [2020-10-20 07:04:00,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:00,610 INFO L82 PathProgramCache]: Analyzing trace with hash -743540257, now seen corresponding path program 1 times [2020-10-20 07:04:00,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:00,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537171179] [2020-10-20 07:04:00,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-20 07:04:00,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537171179] [2020-10-20 07:04:00,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905656652] [2020-10-20 07:04:00,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:04:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:00,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 07:04:00,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:00,772 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-20 07:04:00,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:04:00,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-10-20 07:04:00,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986983407] [2020-10-20 07:04:00,773 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:04:00,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:00,773 INFO L82 PathProgramCache]: Analyzing trace with hash 2102348, now seen corresponding path program 2 times [2020-10-20 07:04:00,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:00,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673176638] [2020-10-20 07:04:00,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:00,783 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:00,793 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:00,795 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:00,953 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:04:00,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 07:04:00,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 07:04:00,953 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 5 Second operand 8 states. [2020-10-20 07:04:01,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:04:01,093 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-10-20 07:04:01,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 07:04:01,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2020-10-20 07:04:01,094 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 07:04:01,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2020-10-20 07:04:01,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 07:04:01,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-20 07:04:01,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2020-10-20 07:04:01,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:04:01,096 INFO L691 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-10-20 07:04:01,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2020-10-20 07:04:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-10-20 07:04:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-20 07:04:01,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-10-20 07:04:01,098 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-10-20 07:04:01,098 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-10-20 07:04:01,099 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 07:04:01,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2020-10-20 07:04:01,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 07:04:01,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:04:01,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:04:01,101 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1] [2020-10-20 07:04:01,101 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 07:04:01,101 INFO L794 eck$LassoCheckResult]: Stem: 938#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 933#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 934#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 935#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 936#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 937#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 956#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 955#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 954#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 953#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 952#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 951#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 950#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 947#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 943#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 944#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 945#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 946#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 949#L26-3 assume !(main_~i~0 >= 0); 939#L26-4 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 940#L32-3 [2020-10-20 07:04:01,101 INFO L796 eck$LassoCheckResult]: Loop: 940#L32-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem13 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem14 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem13 == main_#t~mem14 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 941#L6 assume !(0 == __VERIFIER_assert_~cond); 942#L6-2 havoc main_#t~mem13;havoc main_#t~mem14;main_#t~post15 := main_~j~0;main_~j~0 := main_#t~post15 - 1;havoc main_#t~post15; 948#L32-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 940#L32-3 [2020-10-20 07:04:01,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:01,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1577559391, now seen corresponding path program 2 times [2020-10-20 07:04:01,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:01,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778035624] [2020-10-20 07:04:01,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:01,221 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-20 07:04:01,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778035624] [2020-10-20 07:04:01,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379917534] [2020-10-20 07:04:01,222 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:04:01,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 07:04:01,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:04:01,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 07:04:01,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-20 07:04:01,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:04:01,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2020-10-20 07:04:01,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146158566] [2020-10-20 07:04:01,337 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:04:01,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:01,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2102348, now seen corresponding path program 3 times [2020-10-20 07:04:01,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:01,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754288932] [2020-10-20 07:04:01,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:01,344 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:01,350 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:01,352 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:01,525 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2020-10-20 07:04:01,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:04:01,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 07:04:01,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-20 07:04:01,527 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 5 Second operand 10 states. [2020-10-20 07:04:01,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:04:01,691 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-10-20 07:04:01,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 07:04:01,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 29 transitions. [2020-10-20 07:04:01,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 07:04:01,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 29 transitions. [2020-10-20 07:04:01,693 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 07:04:01,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-20 07:04:01,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2020-10-20 07:04:01,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:04:01,696 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-10-20 07:04:01,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2020-10-20 07:04:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2020-10-20 07:04:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-10-20 07:04:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2020-10-20 07:04:01,701 INFO L714 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-10-20 07:04:01,701 INFO L594 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-10-20 07:04:01,701 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 07:04:01,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2020-10-20 07:04:01,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 07:04:01,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:04:01,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:04:01,703 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1] [2020-10-20 07:04:01,704 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 07:04:01,704 INFO L794 eck$LassoCheckResult]: Stem: 1067#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1062#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 1063#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1064#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1065#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1066#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1087#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1086#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1085#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1084#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1083#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1082#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1081#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 1077#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 1072#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1073#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1074#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1075#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1076#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1080#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1079#L26-3 assume !(main_~i~0 >= 0); 1068#L26-4 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 1069#L32-3 [2020-10-20 07:04:01,704 INFO L796 eck$LassoCheckResult]: Loop: 1069#L32-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem13 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem14 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem13 == main_#t~mem14 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1070#L6 assume !(0 == __VERIFIER_assert_~cond); 1071#L6-2 havoc main_#t~mem13;havoc main_#t~mem14;main_#t~post15 := main_~j~0;main_~j~0 := main_#t~post15 - 1;havoc main_#t~post15; 1078#L32-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 1069#L32-3 [2020-10-20 07:04:01,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:01,705 INFO L82 PathProgramCache]: Analyzing trace with hash 88937187, now seen corresponding path program 3 times [2020-10-20 07:04:01,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:01,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735780375] [2020-10-20 07:04:01,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:01,894 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-20 07:04:01,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735780375] [2020-10-20 07:04:01,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131527215] [2020-10-20 07:04:01,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:04:01,984 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-20 07:04:01,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:04:01,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-20 07:04:01,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-20 07:04:02,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:04:02,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-10-20 07:04:02,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923988059] [2020-10-20 07:04:02,063 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:04:02,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:02,063 INFO L82 PathProgramCache]: Analyzing trace with hash 2102348, now seen corresponding path program 4 times [2020-10-20 07:04:02,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:02,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585398543] [2020-10-20 07:04:02,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:02,069 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:02,073 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:02,075 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:02,236 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2020-10-20 07:04:02,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:04:02,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 07:04:02,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-10-20 07:04:02,238 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 5 Second operand 11 states. [2020-10-20 07:04:02,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:04:02,422 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-10-20 07:04:02,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 07:04:02,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2020-10-20 07:04:02,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 07:04:02,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 31 transitions. [2020-10-20 07:04:02,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-10-20 07:04:02,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-20 07:04:02,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 31 transitions. [2020-10-20 07:04:02,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:04:02,426 INFO L691 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-10-20 07:04:02,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 31 transitions. [2020-10-20 07:04:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2020-10-20 07:04:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-20 07:04:02,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-10-20 07:04:02,430 INFO L714 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-10-20 07:04:02,431 INFO L594 BuchiCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-10-20 07:04:02,431 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 07:04:02,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 30 transitions. [2020-10-20 07:04:02,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 07:04:02,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:04:02,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:04:02,432 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2020-10-20 07:04:02,433 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 07:04:02,433 INFO L794 eck$LassoCheckResult]: Stem: 1209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1204#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 1205#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1206#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1207#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1208#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1228#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1227#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1226#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1225#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1224#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1223#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1222#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 1218#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 1214#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1215#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1216#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1217#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1231#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1230#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1229#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1221#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1220#L26-3 assume !(main_~i~0 >= 0); 1210#L26-4 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 1211#L32-3 [2020-10-20 07:04:02,433 INFO L796 eck$LassoCheckResult]: Loop: 1211#L32-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem13 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem14 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem13 == main_#t~mem14 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1212#L6 assume !(0 == __VERIFIER_assert_~cond); 1213#L6-2 havoc main_#t~mem13;havoc main_#t~mem14;main_#t~post15 := main_~j~0;main_~j~0 := main_#t~post15 - 1;havoc main_#t~post15; 1219#L32-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 1211#L32-3 [2020-10-20 07:04:02,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:02,433 INFO L82 PathProgramCache]: Analyzing trace with hash -430652763, now seen corresponding path program 4 times [2020-10-20 07:04:02,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:02,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938394108] [2020-10-20 07:04:02,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:02,605 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-20 07:04:02,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938394108] [2020-10-20 07:04:02,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853232484] [2020-10-20 07:04:02,605 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:04:02,672 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-20 07:04:02,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:04:02,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 18 conjunts are in the unsatisfiable core [2020-10-20 07:04:02,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:02,789 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-10-20 07:04:02,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:04:02,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 15 [2020-10-20 07:04:02,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411130296] [2020-10-20 07:04:02,790 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:04:02,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:02,791 INFO L82 PathProgramCache]: Analyzing trace with hash 2102348, now seen corresponding path program 5 times [2020-10-20 07:04:02,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:02,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058013687] [2020-10-20 07:04:02,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:02,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:02,796 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:02,800 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:02,803 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:02,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:04:02,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-20 07:04:02,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2020-10-20 07:04:02,943 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. cyclomatic complexity: 5 Second operand 15 states. [2020-10-20 07:04:03,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:04:03,406 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2020-10-20 07:04:03,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 07:04:03,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 48 transitions. [2020-10-20 07:04:03,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 07:04:03,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 48 transitions. [2020-10-20 07:04:03,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-10-20 07:04:03,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-10-20 07:04:03,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 48 transitions. [2020-10-20 07:04:03,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:04:03,410 INFO L691 BuchiCegarLoop]: Abstraction has 46 states and 48 transitions. [2020-10-20 07:04:03,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 48 transitions. [2020-10-20 07:04:03,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 30. [2020-10-20 07:04:03,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-20 07:04:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-10-20 07:04:03,413 INFO L714 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-10-20 07:04:03,413 INFO L594 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-10-20 07:04:03,413 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-20 07:04:03,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2020-10-20 07:04:03,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-10-20 07:04:03,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:04:03,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:04:03,415 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2020-10-20 07:04:03,415 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 07:04:03,415 INFO L794 eck$LassoCheckResult]: Stem: 1388#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(18);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1383#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~post7, main_#t~mem10, main_#t~post11, main_#t~post9, main_#t~mem13, main_#t~mem14, main_#t~post15, main_#t~post12, main_~max~0, main_~#str1~0.base, main_~#str1~0.offset, main_~#str2~0.base, main_~#str2~0.offset, main_~i~0, main_~j~0;main_~max~0 := 5;call main_~#str1~0.base, main_~#str1~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));call main_~#str2~0.base, main_~#str2~0.offset := #Ultimate.allocOnStack((if main_~max~0 % 4294967296 % 4294967296 <= 2147483647 then main_~max~0 % 4294967296 % 4294967296 else main_~max~0 % 4294967296 % 4294967296 - 4294967296));havoc main_~i~0;havoc main_~j~0;main_~i~0 := 0; 1384#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1385#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1386#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1387#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1412#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1410#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1408#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1406#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1404#L18-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call write~int(main_#t~nondet8, main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);havoc main_#t~nondet8; 1402#L18-2 main_#t~post7 := main_~i~0;main_~i~0 := 1 + main_#t~post7;havoc main_#t~post7; 1401#L18-3 assume !(main_~i~0 % 4294967296 < main_~max~0 % 4294967296); 1398#L18-4 call write~int(0, main_~#str1~0.base, main_~#str1~0.offset + (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296), 1);main_~j~0 := 0;main_~i~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296); 1393#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1394#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1395#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1396#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1411#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1409#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1407#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1405#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1403#L26-3 assume !!(main_~i~0 >= 0);call main_#t~mem10 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call write~int(main_#t~mem10, main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);havoc main_#t~mem10;main_#t~post11 := main_~j~0;main_~j~0 := 1 + main_#t~post11;havoc main_#t~post11; 1400#L26-2 main_#t~post9 := main_~i~0;main_~i~0 := main_#t~post9 - 1;havoc main_#t~post9; 1399#L26-3 assume !(main_~i~0 >= 0); 1389#L26-4 main_~j~0 := (if (main_~max~0 - 1) % 4294967296 % 4294967296 <= 2147483647 then (main_~max~0 - 1) % 4294967296 % 4294967296 else (main_~max~0 - 1) % 4294967296 % 4294967296 - 4294967296);main_~i~0 := 0; 1390#L32-3 [2020-10-20 07:04:03,415 INFO L796 eck$LassoCheckResult]: Loop: 1390#L32-3 assume !!(main_~i~0 % 4294967296 < main_~max~0 % 4294967296);call main_#t~mem13 := read~int(main_~#str1~0.base, main_~#str1~0.offset + main_~i~0, 1);call main_#t~mem14 := read~int(main_~#str2~0.base, main_~#str2~0.offset + main_~j~0, 1);__VERIFIER_assert_#in~cond := (if main_#t~mem13 == main_#t~mem14 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1391#L6 assume !(0 == __VERIFIER_assert_~cond); 1392#L6-2 havoc main_#t~mem13;havoc main_#t~mem14;main_#t~post15 := main_~j~0;main_~j~0 := main_#t~post15 - 1;havoc main_#t~post15; 1397#L32-2 main_#t~post12 := main_~i~0;main_~i~0 := 1 + main_#t~post12;havoc main_#t~post12; 1390#L32-3 [2020-10-20 07:04:03,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:03,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1540388377, now seen corresponding path program 5 times [2020-10-20 07:04:03,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:03,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140482751] [2020-10-20 07:04:03,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:03,442 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:03,469 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:03,475 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:03,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:03,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2102348, now seen corresponding path program 6 times [2020-10-20 07:04:03,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:03,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312164903] [2020-10-20 07:04:03,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:03,480 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:03,484 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:03,486 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:03,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:03,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1945355470, now seen corresponding path program 1 times [2020-10-20 07:04:03,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:03,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213373210] [2020-10-20 07:04:03,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:03,525 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:03,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:03,586 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:03,768 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2020-10-20 07:04:20,545 WARN L193 SmtUtils]: Spent 16.77 s on a formula simplification. DAG size of input: 312 DAG size of output: 232 [2020-10-20 07:04:20,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 07:04:20,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:04:20,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:04:20,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:04:20,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:04:20,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 07:04:20,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 07:04:20,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 07:04:54,259 WARN L193 SmtUtils]: Spent 33.65 s on a formula simplification. DAG size of input: 308 DAG size of output: 144 [2020-10-20 07:04:54,262 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:04:54,262 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:04:54,262 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:04:54,263 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:04:54,263 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:04:54,263 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:54,263 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:04:54,263 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:04:54,263 INFO L133 ssoRankerPreferences]: Filename of dumped script: invert_string-3.c_Iteration13_Lasso [2020-10-20 07:04:54,263 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:04:54,263 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:04:54,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:54,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:54,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:54,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:54,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:54,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:54,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:54,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:54,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 07:04:55,960 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:461) 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:382) 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:320) 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-10-20 07:04:55,965 INFO L168 Benchmark]: Toolchain (without parser) took 81708.25 ms. Allocated memory was 35.1 MB in the beginning and 101.2 MB in the end (delta: 66.1 MB). Free memory was 12.9 MB in the beginning and 66.7 MB in the end (delta: -53.8 MB). Peak memory consumption was 77.2 MB. Max. memory is 14.3 GB. [2020-10-20 07:04:55,966 INFO L168 Benchmark]: CDTParser took 0.99 ms. Allocated memory is still 34.1 MB. Free memory was 19.3 MB in the beginning and 19.3 MB in the end (delta: 29.6 kB). Peak memory consumption was 29.6 kB. Max. memory is 14.3 GB. [2020-10-20 07:04:55,967 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.66 ms. Allocated memory was 35.1 MB in the beginning and 43.5 MB in the end (delta: 8.4 MB). Free memory was 12.1 MB in the beginning and 23.7 MB in the end (delta: -11.6 MB). Peak memory consumption was 10.7 MB. Max. memory is 14.3 GB. [2020-10-20 07:04:55,967 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.00 ms. Allocated memory is still 43.5 MB. Free memory was 23.7 MB in the beginning and 21.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. [2020-10-20 07:04:55,968 INFO L168 Benchmark]: Boogie Preprocessor took 29.73 ms. Allocated memory is still 43.5 MB. Free memory was 21.8 MB in the beginning and 20.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.3 GB. [2020-10-20 07:04:55,969 INFO L168 Benchmark]: RCFGBuilder took 389.45 ms. Allocated memory was 43.5 MB in the beginning and 45.6 MB in the end (delta: 2.1 MB). Free memory was 20.3 MB in the beginning and 16.8 MB in the end (delta: 3.6 MB). Peak memory consumption was 9.4 MB. Max. memory is 14.3 GB. [2020-10-20 07:04:55,969 INFO L168 Benchmark]: BuchiAutomizer took 80885.69 ms. Allocated memory was 45.6 MB in the beginning and 101.2 MB in the end (delta: 55.6 MB). Free memory was 16.5 MB in the beginning and 66.7 MB in the end (delta: -50.1 MB). Peak memory consumption was 70.4 MB. Max. memory is 14.3 GB. [2020-10-20 07:04:55,972 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.99 ms. Allocated memory is still 34.1 MB. Free memory was 19.3 MB in the beginning and 19.3 MB in the end (delta: 29.6 kB). Peak memory consumption was 29.6 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 349.66 ms. Allocated memory was 35.1 MB in the beginning and 43.5 MB in the end (delta: 8.4 MB). Free memory was 12.1 MB in the beginning and 23.7 MB in the end (delta: -11.6 MB). Peak memory consumption was 10.7 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 44.00 ms. Allocated memory is still 43.5 MB. Free memory was 23.7 MB in the beginning and 21.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 29.73 ms. Allocated memory is still 43.5 MB. Free memory was 21.8 MB in the beginning and 20.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 14.3 GB. * RCFGBuilder took 389.45 ms. Allocated memory was 43.5 MB in the beginning and 45.6 MB in the end (delta: 2.1 MB). Free memory was 20.3 MB in the beginning and 16.8 MB in the end (delta: 3.6 MB). Peak memory consumption was 9.4 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 80885.69 ms. Allocated memory was 45.6 MB in the beginning and 101.2 MB in the end (delta: 55.6 MB). Free memory was 16.5 MB in the beginning and 66.7 MB in the end (delta: -50.1 MB). Peak memory consumption was 70.4 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: 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...